./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1250.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_1250.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 b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:52,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:52,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:52,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:52,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:52,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:52,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:52,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:52,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:52,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:52,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:52,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:52,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:52,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:52,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:52,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:52,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:52,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:52,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:52,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:52,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:52,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:52,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:52,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:52,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:52,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:52,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:52,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:52,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:52,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:52,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:52,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:52,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:52,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:52,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:52,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:52,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:52,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:52,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:52,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:52,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:52,548 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:52,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:52,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:52,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:52,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:52,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:52,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:52,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:52,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:52,576 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:52,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:52,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:52,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:52,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:52,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:52,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:52,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:52,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:52,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:52,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:52,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:52,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:52,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:52,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:52,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:52,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:52,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:52,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:52,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:52,580 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 -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2022-02-20 16:46:52,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:52,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:52,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:52,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:52,797 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:52,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2022-02-20 16:46:52,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dadba13/1823f22280b9469ba6928b69b54371ac/FLAG0bd447e17 [2022-02-20 16:46:53,133 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:53,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2022-02-20 16:46:53,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dadba13/1823f22280b9469ba6928b69b54371ac/FLAG0bd447e17 [2022-02-20 16:46:53,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dadba13/1823f22280b9469ba6928b69b54371ac [2022-02-20 16:46:53,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:53,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:53,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:53,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:53,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:53,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:53" (1/1) ... [2022-02-20 16:46:53,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f225c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:53, skipping insertion in model container [2022-02-20 16:46:53,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:53" (1/1) ... [2022-02-20 16:46:53,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:53,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:53,733 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_1250.c[1719,1732] [2022-02-20 16:46:53,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:53,745 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:53,765 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_1250.c[1719,1732] [2022-02-20 16:46:53,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:53,774 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:53,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:53 WrapperNode [2022-02-20 16:46:53,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:53,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:53,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:53,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:53,781 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:53" (1/1) ... [2022-02-20 16:46:53,786 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:53" (1/1) ... [2022-02-20 16:46:53,798 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-02-20 16:46:53,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:53,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:53,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:53,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:53,804 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:53" (1/1) ... [2022-02-20 16:46:53,805 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:53" (1/1) ... [2022-02-20 16:46:53,806 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:53" (1/1) ... [2022-02-20 16:46:53,806 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:53" (1/1) ... [2022-02-20 16:46:53,811 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:53" (1/1) ... [2022-02-20 16:46:53,814 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:53" (1/1) ... [2022-02-20 16:46:53,815 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:53" (1/1) ... [2022-02-20 16:46:53,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:53,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:53,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:53,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:53,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:53" (1/1) ... [2022-02-20 16:46:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:53,845 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:53,850 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:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-02-20 16:46:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:53,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:53,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:53,935 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:53,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:54,208 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:54,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:54,216 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:46:54,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:54 BoogieIcfgContainer [2022-02-20 16:46:54,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:54,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:54,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:54,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:54,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:53" (1/3) ... [2022-02-20 16:46:54,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2c963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:54, skipping insertion in model container [2022-02-20 16:46:54,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:53" (2/3) ... [2022-02-20 16:46:54,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2c963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:54, skipping insertion in model container [2022-02-20 16:46:54,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:54" (3/3) ... [2022-02-20 16:46:54,231 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2022-02-20 16:46:54,239 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:54,239 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:54,271 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:54,276 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:54,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:54,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:54,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:54,293 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1232868241, now seen corresponding path program 1 times [2022-02-20 16:46:54,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:54,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842371279] [2022-02-20 16:46:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:54,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {30#true} is VALID [2022-02-20 16:46:54,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:46:54,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {31#false} is VALID [2022-02-20 16:46:54,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:46:54,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:46:54,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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); {30#true} is VALID [2022-02-20 16:46:54,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {30#true} is VALID [2022-02-20 16:46:54,495 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:54,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {30#true} is VALID [2022-02-20 16:46:54,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:46:54,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {31#false} is VALID [2022-02-20 16:46:54,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:46:54,497 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:46:54,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume -2147483648 <= fmax_float_#t~ret5#1 && fmax_float_#t~ret5#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:46:54,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {31#false} is VALID [2022-02-20 16:46:54,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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); {31#false} is VALID [2022-02-20 16:46:54,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#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; {31#false} is VALID [2022-02-20 16:46:54,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {31#false} is VALID [2022-02-20 16:46:54,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 16:46:54,499 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:54,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:54,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842371279] [2022-02-20 16:46:54,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842371279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:54,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:54,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:54,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902630142] [2022-02-20 16:46:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:54,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:54,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,528 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:54,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:54,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:54,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:54,550 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,638 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 16:46:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:46:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:46:54,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 16:46:54,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:54,713 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:46:54,714 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:46:54,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:54,718 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:54,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:46:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:46:54,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:54,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:54,739 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:54,740 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,742 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:46:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:54,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:54,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:54,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:46:54,744 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:46:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,746 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:46:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:54,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:54,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:54,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:54,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-20 16:46:54,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2022-02-20 16:46:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:54,750 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-20 16:46:54,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:54,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:54,751 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:54,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:54,752 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1566908876, now seen corresponding path program 1 times [2022-02-20 16:46:54,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:54,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333157910] [2022-02-20 16:46:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:54,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {182#true} is VALID [2022-02-20 16:46:54,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {182#true} is VALID [2022-02-20 16:46:54,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:46:54,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:54,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} assume true; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:54,843 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:54,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#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); {182#true} is VALID [2022-02-20 16:46:54,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {182#true} is VALID [2022-02-20 16:46:54,845 INFO L272 TraceCheckUtils]: 2: Hoare triple {182#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:54,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {182#true} is VALID [2022-02-20 16:46:54,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {182#true} is VALID [2022-02-20 16:46:54,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:46:54,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:54,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} assume true; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:54,848 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:54,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} assume -2147483648 <= fmax_float_#t~ret5#1 && fmax_float_#t~ret5#1 <= 2147483647; {190#(= (+ (- 2) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:54,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} assume 0 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {183#false} is VALID [2022-02-20 16:46:54,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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); {183#false} is VALID [2022-02-20 16:46:54,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#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; {183#false} is VALID [2022-02-20 16:46:54,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {183#false} is VALID [2022-02-20 16:46:54,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 16:46:54,850 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:54,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:54,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333157910] [2022-02-20 16:46:54,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333157910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:54,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:54,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:54,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968808178] [2022-02-20 16:46:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:54,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:54,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:54,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:54,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:54,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:54,867 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,949 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:46:54,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:54,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:54,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:54,982 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:54,982 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:46:54,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:54,984 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:54,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:46:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:46:54,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:54,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:54,988 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:54,988 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,990 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:54,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:54,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:54,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:54,991 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:54,992 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:54,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:54,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:54,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:54,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:54,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2022-02-20 16:46:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:54,995 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:54,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:54,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:54,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:54,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:54,997 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1928564788, now seen corresponding path program 1 times [2022-02-20 16:46:54,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:54,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178355428] [2022-02-20 16:46:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {326#true} is VALID [2022-02-20 16:46:55,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {326#true} is VALID [2022-02-20 16:46:55,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:46:55,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {326#true} is VALID [2022-02-20 16:46:55,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} assume (~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687);#res := 4; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:55,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#(= |__fpclassify_float_#res| 4)} assume true; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:55,062 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {337#(= |__fpclassify_float_#res| 4)} {326#true} #69#return; {335#(<= 4 |ULTIMATE.start_fmax_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:55,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#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); {326#true} is VALID [2022-02-20 16:46:55,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {326#true} is VALID [2022-02-20 16:46:55,063 INFO L272 TraceCheckUtils]: 2: Hoare triple {326#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:55,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {326#true} is VALID [2022-02-20 16:46:55,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {326#true} is VALID [2022-02-20 16:46:55,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:46:55,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {326#true} is VALID [2022-02-20 16:46:55,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} assume (~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687);#res := 4; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:55,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= |__fpclassify_float_#res| 4)} assume true; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:55,065 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#(= |__fpclassify_float_#res| 4)} {326#true} #69#return; {335#(<= 4 |ULTIMATE.start_fmax_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:55,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(<= 4 |ULTIMATE.start_fmax_float_#t~ret5#1|)} assume -2147483648 <= fmax_float_#t~ret5#1 && fmax_float_#t~ret5#1 <= 2147483647; {335#(<= 4 |ULTIMATE.start_fmax_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:55,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#(<= 4 |ULTIMATE.start_fmax_float_#t~ret5#1|)} assume 0 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {327#false} is VALID [2022-02-20 16:46:55,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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); {327#false} is VALID [2022-02-20 16:46:55,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#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; {327#false} is VALID [2022-02-20 16:46:55,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {327#false} is VALID [2022-02-20 16:46:55,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-02-20 16:46:55,068 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:55,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:55,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178355428] [2022-02-20 16:46:55,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178355428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:55,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:55,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:55,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612641706] [2022-02-20 16:46:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:55,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:55,070 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), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:55,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:55,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:55,085 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,167 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:55,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,200 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:55,200 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:55,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55,201 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:55,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,205 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,205 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,207 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,208 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,210 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:55,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2022-02-20 16:46:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,212 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:55,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:55,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:55,213 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash -20784584, now seen corresponding path program 1 times [2022-02-20 16:46:55,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:55,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076515241] [2022-02-20 16:46:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {483#true} is VALID [2022-02-20 16:46:55,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {483#true} is VALID [2022-02-20 16:46:55,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:46:55,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {483#true} is VALID [2022-02-20 16:46:55,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {483#true} is VALID [2022-02-20 16:46:55,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} assume (~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255);#res := 3; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:55,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} assume true; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:55,280 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} {483#true} #69#return; {493#(= 0 (+ (- 3) |ULTIMATE.start_fmax_float_#t~ret5#1|))} is VALID [2022-02-20 16:46:55,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#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); {483#true} is VALID [2022-02-20 16:46:55,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {483#true} is VALID [2022-02-20 16:46:55,281 INFO L272 TraceCheckUtils]: 2: Hoare triple {483#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:55,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {483#true} is VALID [2022-02-20 16:46:55,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {483#true} is VALID [2022-02-20 16:46:55,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:46:55,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {483#true} is VALID [2022-02-20 16:46:55,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {483#true} is VALID [2022-02-20 16:46:55,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#true} assume (~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255);#res := 3; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:55,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} assume true; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:55,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} {483#true} #69#return; {493#(= 0 (+ (- 3) |ULTIMATE.start_fmax_float_#t~ret5#1|))} is VALID [2022-02-20 16:46:55,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= 0 (+ (- 3) |ULTIMATE.start_fmax_float_#t~ret5#1|))} assume -2147483648 <= fmax_float_#t~ret5#1 && fmax_float_#t~ret5#1 <= 2147483647; {493#(= 0 (+ (- 3) |ULTIMATE.start_fmax_float_#t~ret5#1|))} is VALID [2022-02-20 16:46:55,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= 0 (+ (- 3) |ULTIMATE.start_fmax_float_#t~ret5#1|))} assume 0 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {484#false} is VALID [2022-02-20 16:46:55,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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); {484#false} is VALID [2022-02-20 16:46:55,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#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; {484#false} is VALID [2022-02-20 16:46:55,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {484#false} is VALID [2022-02-20 16:46:55,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-02-20 16:46:55,286 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:55,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:55,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076515241] [2022-02-20 16:46:55,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076515241] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:55,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:55,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:55,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340205373] [2022-02-20 16:46:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:55,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:55,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,300 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:55,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:55,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:55,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:55,302 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,385 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:55,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:55,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,441 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:55,441 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:55,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55,442 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:55,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,445 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,445 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,446 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,447 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,448 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:55,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2022-02-20 16:46:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,451 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:55,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:55,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:46:55,464 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1039043768, now seen corresponding path program 1 times [2022-02-20 16:46:55,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:55,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836227185] [2022-02-20 16:46:55,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {641#true} is VALID [2022-02-20 16:46:55,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {641#true} is VALID [2022-02-20 16:46:55,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:46:55,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {641#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {641#true} is VALID [2022-02-20 16:46:55,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {641#true} is VALID [2022-02-20 16:46:55,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {641#true} is VALID [2022-02-20 16:46:55,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:55,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} assume true; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:55,582 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:55,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#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); {641#true} is VALID [2022-02-20 16:46:55,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {641#true} is VALID [2022-02-20 16:46:55,584 INFO L272 TraceCheckUtils]: 2: Hoare triple {641#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:55,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {641#true} is VALID [2022-02-20 16:46:55,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {641#true} is VALID [2022-02-20 16:46:55,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:46:55,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {641#true} is VALID [2022-02-20 16:46:55,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {641#true} is VALID [2022-02-20 16:46:55,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {641#true} is VALID [2022-02-20 16:46:55,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:55,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} assume true; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:55,586 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:55,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} assume -2147483648 <= fmax_float_#t~ret5#1 && fmax_float_#t~ret5#1 <= 2147483647; {652#(= (+ (- 1) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:55,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmax_float_#t~ret5#1|) 0)} assume 0 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {642#false} is VALID [2022-02-20 16:46:55,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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); {642#false} is VALID [2022-02-20 16:46:55,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#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; {642#false} is VALID [2022-02-20 16:46:55,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {642#false} is VALID [2022-02-20 16:46:55,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 16:46:55,588 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:55,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:55,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836227185] [2022-02-20 16:46:55,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836227185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:55,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:55,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:55,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430851851] [2022-02-20 16:46:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 16:46:55,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:55,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:55,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:55,617 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,726 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:55,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 16:46:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:55,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:55,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,777 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:55,777 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:55,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55,778 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:55,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,780 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,780 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,782 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,782 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,784 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:55,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:55,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-02-20 16:46:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,786 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:55,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:55,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:46:55,787 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -768410695, now seen corresponding path program 1 times [2022-02-20 16:46:55,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:55,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229244629] [2022-02-20 16:46:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:55,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:55,874 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:55,874 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:55,875 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:55,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:46:55,878 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,893 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:55,900 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret5 := __fpclassify_float(~x); [2022-02-20 16:46:55,901 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:46:55,916 INFO L158 Benchmark]: Toolchain (without parser) took 2337.98ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 66.6MB in the beginning and 72.7MB in the end (delta: -6.1MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:55,917 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:55,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 96.5MB. Free memory was 66.6MB in the beginning and 72.1MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:55,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.72ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:55,918 INFO L158 Benchmark]: Boogie Preprocessor took 17.05ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 69.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:55,918 INFO L158 Benchmark]: RCFGBuilder took 402.10ms. Allocated memory is still 96.5MB. Free memory was 69.1MB in the beginning and 56.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:55,918 INFO L158 Benchmark]: TraceAbstraction took 1695.50ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 55.8MB in the beginning and 72.7MB in the end (delta: -16.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:55,919 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.16ms. Allocated memory is still 96.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 96.5MB. Free memory was 66.6MB in the beginning and 72.1MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.72ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.05ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 69.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 402.10ms. Allocated memory is still 96.5MB. Free memory was 69.1MB in the beginning and 56.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1695.50ms. Allocated memory was 96.5MB in the beginning and 136.3MB in the end (delta: 39.8MB). Free memory was 55.8MB in the beginning and 72.7MB in the end (delta: -16.9MB). Peak memory consumption was 26.1MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:46:55,954 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_1250.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 b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:57,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:57,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:57,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:57,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:57,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:57,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:57,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:57,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:57,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:57,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:57,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:57,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:57,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:57,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:57,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:57,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:57,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:57,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:57,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:57,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:57,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:57,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:57,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:57,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:57,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:57,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:57,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:57,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:57,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:57,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:57,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:57,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:57,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:57,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:57,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:57,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:57,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:57,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:57,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:57,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:57,879 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:57,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:57,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:57,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:57,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:57,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:57,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:57,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:57,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:57,913 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:57,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:57,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:57,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:57,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:57,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:57,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:57,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:57,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:57,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:57,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:57,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:57,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:57,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:57,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:57,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:57,917 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:57,917 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:57,917 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:57,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:57,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:57,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:57,918 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 -> b1947c2cfa9d661d99206b001fd8998d6aae9b547d6aa58efd3f1b0fdfd07645 [2022-02-20 16:46:58,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:58,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:58,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:58,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:58,227 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:58,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2022-02-20 16:46:58,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a336ae081/2c1f482105734ee38469cacda512fbe4/FLAG89ab36798 [2022-02-20 16:46:58,732 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:58,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2022-02-20 16:46:58,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a336ae081/2c1f482105734ee38469cacda512fbe4/FLAG89ab36798 [2022-02-20 16:46:59,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a336ae081/2c1f482105734ee38469cacda512fbe4 [2022-02-20 16:46:59,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:59,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:59,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:59,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:59,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:59,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:59" (1/1) ... [2022-02-20 16:46:59,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6ab08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:59, skipping insertion in model container [2022-02-20 16:46:59,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:59" (1/1) ... [2022-02-20 16:46:59,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:59,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:59,355 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_1250.c[1719,1732] [2022-02-20 16:46:59,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:59,372 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:59,400 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_1250.c[1719,1732] [2022-02-20 16:46:59,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:59,419 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:59,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:59 WrapperNode [2022-02-20 16:46:59,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:59,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:59,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:59,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:59,425 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:59" (1/1) ... [2022-02-20 16:46:59,438 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:59" (1/1) ... [2022-02-20 16:46:59,455 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2022-02-20 16:46:59,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:59,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:59,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:59,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:59,462 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:59" (1/1) ... [2022-02-20 16:46:59,462 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:59" (1/1) ... [2022-02-20 16:46:59,470 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:59" (1/1) ... [2022-02-20 16:46:59,470 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:59" (1/1) ... [2022-02-20 16:46:59,484 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:59" (1/1) ... [2022-02-20 16:46:59,486 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:59" (1/1) ... [2022-02-20 16:46:59,487 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:59" (1/1) ... [2022-02-20 16:46:59,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:59,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:59,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:59,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:59,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:59" (1/1) ... [2022-02-20 16:46:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:59,514 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:59,524 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:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-02-20 16:46:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-02-20 16:46:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:59,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:59,597 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:59,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:59,724 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:59,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:59,728 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:46:59,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:59 BoogieIcfgContainer [2022-02-20 16:46:59,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:59,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:59,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:59,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:59" (1/3) ... [2022-02-20 16:46:59,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b72fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:59, skipping insertion in model container [2022-02-20 16:46:59,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:59" (2/3) ... [2022-02-20 16:46:59,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b72fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:59, skipping insertion in model container [2022-02-20 16:46:59,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:59" (3/3) ... [2022-02-20 16:46:59,734 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2022-02-20 16:46:59,738 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:59,738 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:59,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:59,771 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:59,771 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:59,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:59,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:59,817 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2048951326, now seen corresponding path program 1 times [2022-02-20 16:46:59,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:59,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602537421] [2022-02-20 16:46:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:59,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:59,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:59,832 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:59,832 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:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:59,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 16:46:59,991 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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {28#true} is VALID [2022-02-20 16:46:59,991 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {28#true} is VALID [2022-02-20 16:46:59,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~x := #in~x;havoc ~w~0; {28#true} is VALID [2022-02-20 16:46:59,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:59,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {29#false} is VALID [2022-02-20 16:46:59,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 16:46:59,993 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29#false} {28#true} #67#return; {29#false} is VALID [2022-02-20 16:46:59,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume 0bv32 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {29#false} is VALID [2022-02-20 16:46:59,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {29#false} is VALID [2022-02-20 16:46:59,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {29#false} is VALID [2022-02-20 16:46:59,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {29#false} is VALID [2022-02-20 16:46:59,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:59,996 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:59,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:59,996 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:59,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602537421] [2022-02-20 16:46:59,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602537421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:59,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:59,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:59,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90524612] [2022-02-20 16:47:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:00,005 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 16:47:00,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:00,010 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:00,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:47:00,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:47:00,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:47:00,054 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,102 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-02-20 16:47:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:47:00,103 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 16:47:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:00,103 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:47:00,108 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:47:00,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:47:00,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:00,172 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:47:00,173 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:47:00,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:47:00,177 INFO L933 BasicCegarLoop]: 32 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, 32 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:47:00,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:47:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:47:00,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:00,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:00,196 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:00,196 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,199 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:47:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:47:00,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:47:00,200 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:47:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,202 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:47:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:47:00,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:00,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-02-20 16:47:00,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2022-02-20 16:47:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:00,205 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-20 16:47:00,206 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:47:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:47:00,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:00,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:00,217 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:47:00,414 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:47:00,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1561923165, now seen corresponding path program 1 times [2022-02-20 16:47:00,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:00,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769671408] [2022-02-20 16:47:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:00,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:00,418 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:47:00,420 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:47:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:00,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:00,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:00,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#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); {200#true} is VALID [2022-02-20 16:47:00,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {200#true} is VALID [2022-02-20 16:47:00,523 INFO L272 TraceCheckUtils]: 2: Hoare triple {200#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {200#true} is VALID [2022-02-20 16:47:00,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#true} ~x := #in~x;havoc ~w~0; {200#true} is VALID [2022-02-20 16:47:00,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {200#true} is VALID [2022-02-20 16:47:00,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#true} goto; {200#true} is VALID [2022-02-20 16:47:00,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {223#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:00,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (_ bv2 32) |__fpclassify_float_#res|)} assume true; {223#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:00,526 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {223#(= (_ bv2 32) |__fpclassify_float_#res|)} {200#true} #67#return; {230#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv2 32))} is VALID [2022-02-20 16:47:00,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv2 32))} assume 0bv32 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {201#false} is VALID [2022-02-20 16:47:00,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {201#false} is VALID [2022-02-20 16:47:00,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {201#false} is VALID [2022-02-20 16:47:00,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {201#false} is VALID [2022-02-20 16:47:00,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#false} assume !false; {201#false} is VALID [2022-02-20 16:47:00,527 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:47:00,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:00,527 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:00,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769671408] [2022-02-20 16:47:00,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769671408] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:00,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:00,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:00,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998462024] [2022-02-20 16:47:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:47:00,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:00,529 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), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,541 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:47:00,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:00,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:00,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:00,542 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,615 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:47:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:47:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:00,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:47:00,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:00,653 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:47:00,653 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:47:00,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:00,654 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:00,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:47:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:47:00,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:00,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:00,658 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:00,659 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,660 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:47:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:47:00,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:47:00,661 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:47:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,663 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:47:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:47:00,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:00,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:47:00,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2022-02-20 16:47:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:00,665 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:47:00,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:47:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:47:00,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:00,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:00,677 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:47:00,874 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:47:00,874 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -925102245, now seen corresponding path program 1 times [2022-02-20 16:47:00,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:00,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920302242] [2022-02-20 16:47:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:00,879 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:47:00,881 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:47:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:00,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:00,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#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); {364#true} is VALID [2022-02-20 16:47:00,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {364#true} is VALID [2022-02-20 16:47:00,966 INFO L272 TraceCheckUtils]: 2: Hoare triple {364#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {364#true} is VALID [2022-02-20 16:47:00,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#true} ~x := #in~x;havoc ~w~0; {364#true} is VALID [2022-02-20 16:47:00,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {364#true} is VALID [2022-02-20 16:47:00,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} goto; {364#true} is VALID [2022-02-20 16:47:00,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {364#true} is VALID [2022-02-20 16:47:00,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#true} assume (~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32));#res := 4bv32; {390#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:00,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(= (_ bv4 32) |__fpclassify_float_#res|)} assume true; {390#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:00,968 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {390#(= (_ bv4 32) |__fpclassify_float_#res|)} {364#true} #67#return; {397#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv4 32))} is VALID [2022-02-20 16:47:00,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {397#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv4 32))} assume 0bv32 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {365#false} is VALID [2022-02-20 16:47:00,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {365#false} is VALID [2022-02-20 16:47:00,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {365#false} is VALID [2022-02-20 16:47:00,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {365#false} is VALID [2022-02-20 16:47:00,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 16:47:00,969 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:47:00,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:00,970 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:00,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920302242] [2022-02-20 16:47:00,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920302242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:00,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:00,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:00,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161551118] [2022-02-20 16:47:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:47:00,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:00,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:00,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:00,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:00,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:00,985 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,071 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:47:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:47:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:01,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:47:01,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:01,108 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:47:01,108 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:47:01,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:01,109 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:01,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:47:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:47:01,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:01,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,113 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,113 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,115 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:47:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:47:01,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:01,116 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,117 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:47:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:47:01,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:01,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:47:01,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2022-02-20 16:47:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:01,119 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:47:01,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:47:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:47:01,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:01,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:01,134 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:47:01,328 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:47:01,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1962795417, now seen corresponding path program 1 times [2022-02-20 16:47:01,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:01,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419004141] [2022-02-20 16:47:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:01,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:01,330 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:47:01,332 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:47:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:01,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:01,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#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); {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {540#true} is VALID [2022-02-20 16:47:01,456 INFO L272 TraceCheckUtils]: 2: Hoare triple {540#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {540#true} ~x := #in~x;havoc ~w~0; {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {540#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {540#true} goto; {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {540#true} is VALID [2022-02-20 16:47:01,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {540#true} is VALID [2022-02-20 16:47:01,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#true} assume (~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32));#res := 3bv32; {569#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:01,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(= (_ bv3 32) |__fpclassify_float_#res|)} assume true; {569#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:01,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#(= (_ bv3 32) |__fpclassify_float_#res|)} {540#true} #67#return; {576#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv3 32))} is VALID [2022-02-20 16:47:01,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= |ULTIMATE.start_fmax_float_#t~ret5#1| (_ bv3 32))} assume 0bv32 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {541#false} is VALID [2022-02-20 16:47:01,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {541#false} is VALID [2022-02-20 16:47:01,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {541#false} is VALID [2022-02-20 16:47:01,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {541#false} is VALID [2022-02-20 16:47:01,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 16:47:01,459 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:47:01,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:01,459 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:01,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419004141] [2022-02-20 16:47:01,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419004141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:01,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:01,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:01,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015604371] [2022-02-20 16:47:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:47:01,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:01,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:01,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:01,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:01,478 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,571 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:47:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:01,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:47:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:47:01,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:47:01,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:01,613 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:47:01,613 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:47:01,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:01,614 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:01,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:47:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:47:01,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:01,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,617 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,617 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,619 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:47:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:47:01,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:01,619 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,621 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:47:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:47:01,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:01,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:47:01,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-02-20 16:47:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:01,622 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:47:01,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:47:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:47:01,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:01,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:01,636 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:47:01,831 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:47:01,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1417426806, now seen corresponding path program 1 times [2022-02-20 16:47:01,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:01,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696621440] [2022-02-20 16:47:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:01,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:47:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:01,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:47:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:01,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:02,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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); {719#true} is VALID [2022-02-20 16:47:02,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:02,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {719#true} is VALID [2022-02-20 16:47:02,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#true} ~x := #in~x;havoc ~w~0; {719#true} is VALID [2022-02-20 16:47:02,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {719#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {719#true} goto; {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {719#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#true} assume !((~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32))); {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#true} assume !(2139095040bv32 == ~w~0 || 4286578688bv32 == ~w~0);#res := 0bv32; {719#true} is VALID [2022-02-20 16:47:02,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#true} assume true; {719#true} is VALID [2022-02-20 16:47:02,081 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {719#true} {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:02,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmax_float_#t~ret5#1;havoc fmax_float_#t~ret5#1;fmax_float_#res#1 := fmax_float_~y#1; {761#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:02,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {761#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {765#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:47:02,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {765#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {769#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:47:02,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {720#false} is VALID [2022-02-20 16:47:02,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:47:02,088 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:47:02,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:02,088 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:02,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696621440] [2022-02-20 16:47:02,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696621440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:02,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:02,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:47:02,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771841317] [2022-02-20 16:47:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:02,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:47:02,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:02,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:02,112 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:47:02,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:47:02,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:47:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:47:02,113 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,279 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:47:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:47:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:47:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:47:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:47:02,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 16:47:02,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:02,320 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:47:02,320 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:47:02,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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:47:02,321 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:02,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:47:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:47:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-20 16:47:02,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:02,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:02,324 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,325 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:47:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:47:02,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:02,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:02,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:47:02,326 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:47:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,327 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:47:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:47:02,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:02,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:02,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:02,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 16:47:02,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2022-02-20 16:47:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:02,328 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 16:47:02,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:47:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 16:47:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:47:02,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:02,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:02,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:02,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:02,530 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 642927512, now seen corresponding path program 1 times [2022-02-20 16:47:02,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:02,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444546906] [2022-02-20 16:47:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:02,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:02,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:02,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:47:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:02,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:02,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#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); {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L272 TraceCheckUtils]: 2: Hoare triple {910#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {910#true} ~x := #in~x;havoc ~w~0; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {910#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {910#true} goto; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#true} assume true; {910#true} is VALID [2022-02-20 16:47:02,669 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {910#true} {910#true} #67#return; {910#true} is VALID [2022-02-20 16:47:02,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {910#true} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {910#true} is VALID [2022-02-20 16:47:02,670 INFO L272 TraceCheckUtils]: 10: Hoare triple {910#true} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {910#true} is VALID [2022-02-20 16:47:02,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#true} ~x := #in~x;havoc ~w~0; {910#true} is VALID [2022-02-20 16:47:02,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {910#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {910#true} is VALID [2022-02-20 16:47:02,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {910#true} goto; {910#true} is VALID [2022-02-20 16:47:02,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {957#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:02,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#(= (_ bv2 32) |__fpclassify_float_#res|)} assume true; {957#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:02,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {957#(= (_ bv2 32) |__fpclassify_float_#res|)} {910#true} #69#return; {964#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv2 32))} is VALID [2022-02-20 16:47:02,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {964#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv2 32))} assume 0bv32 == fmax_float_#t~ret6#1;havoc fmax_float_#t~ret6#1;fmax_float_#res#1 := fmax_float_~x#1; {911#false} is VALID [2022-02-20 16:47:02,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {911#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {911#false} is VALID [2022-02-20 16:47:02,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {911#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {911#false} is VALID [2022-02-20 16:47:02,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {911#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {911#false} is VALID [2022-02-20 16:47:02,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {911#false} assume !false; {911#false} is VALID [2022-02-20 16:47:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:47:02,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:02,673 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:02,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444546906] [2022-02-20 16:47:02,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444546906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:02,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:02,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:02,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721038633] [2022-02-20 16:47:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:47:02,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:02,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:02,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:02,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:02,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:02,690 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,765 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:47:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:02,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:47:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:47:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:47:02,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:47:02,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:02,798 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:47:02,798 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:47:02,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:02,799 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:02,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:47:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:47:02,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:02,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:02,802 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:02,802 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,803 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:47:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:47:02,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:02,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:02,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:47:02,803 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:47:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,804 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:47:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:47:02,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:02,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:02,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:02,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:47:02,806 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 22 [2022-02-20 16:47:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:02,806 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:47:02,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:47:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:47:02,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:02,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:02,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:03,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:03,019 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1233179256, now seen corresponding path program 1 times [2022-02-20 16:47:03,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:03,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845023489] [2022-02-20 16:47:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:03,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:03,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:03,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:47:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:03,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:03,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:03,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1098#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); {1098#true} is VALID [2022-02-20 16:47:03,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {1098#true} is VALID [2022-02-20 16:47:03,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {1098#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {1098#true} is VALID [2022-02-20 16:47:03,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {1098#true} ~x := #in~x;havoc ~w~0; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {1098#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#true} goto; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1098#true} {1098#true} #67#return; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#true} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {1098#true} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#true} ~x := #in~x;havoc ~w~0; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1098#true} is VALID [2022-02-20 16:47:03,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#true} goto; {1098#true} is VALID [2022-02-20 16:47:03,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1098#true} is VALID [2022-02-20 16:47:03,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#true} assume (~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32));#res := 4bv32; {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:03,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} assume true; {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:03,172 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} {1098#true} #69#return; {1155#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv4 32))} is VALID [2022-02-20 16:47:03,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1155#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv4 32))} assume 0bv32 == fmax_float_#t~ret6#1;havoc fmax_float_#t~ret6#1;fmax_float_#res#1 := fmax_float_~x#1; {1099#false} is VALID [2022-02-20 16:47:03,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1099#false} is VALID [2022-02-20 16:47:03,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {1099#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1099#false} is VALID [2022-02-20 16:47:03,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {1099#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1099#false} is VALID [2022-02-20 16:47:03,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2022-02-20 16:47:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:47:03,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:03,173 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:03,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845023489] [2022-02-20 16:47:03,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845023489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:03,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:03,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:03,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099738421] [2022-02-20 16:47:03,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:47:03,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:03,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:03,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:03,192 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,297 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:47:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:47:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:47:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:47:03,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:47:03,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,323 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:47:03,323 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:47:03,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:03,323 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:03,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:47:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:47:03,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:03,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,326 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,326 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,327 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:47:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:47:03,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:03,328 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:47:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,329 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:47:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:47:03,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:03,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:47:03,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 23 [2022-02-20 16:47:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:03,330 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:47:03,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:47:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:47:03,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:03,331 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:03,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:03,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:03,552 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash 977434878, now seen corresponding path program 1 times [2022-02-20 16:47:03,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:03,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507842577] [2022-02-20 16:47:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:03,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:03,554 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:03,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:47:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:03,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:47:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:03,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:03,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#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); {1298#true} is VALID [2022-02-20 16:47:03,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:03,722 INFO L272 TraceCheckUtils]: 2: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {1298#true} is VALID [2022-02-20 16:47:03,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {1298#true} ~x := #in~x;havoc ~w~0; {1298#true} is VALID [2022-02-20 16:47:03,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {1298#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1298#true} is VALID [2022-02-20 16:47:03,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} goto; {1298#true} is VALID [2022-02-20 16:47:03,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1298#true} is VALID [2022-02-20 16:47:03,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 16:47:03,726 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1298#true} {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:03,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:03,726 INFO L272 TraceCheckUtils]: 10: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {1298#true} is VALID [2022-02-20 16:47:03,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#true} ~x := #in~x;havoc ~w~0; {1298#true} is VALID [2022-02-20 16:47:03,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1298#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1298#true} is VALID [2022-02-20 16:47:03,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1298#true} goto; {1298#true} is VALID [2022-02-20 16:47:03,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1298#true} is VALID [2022-02-20 16:47:03,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 16:47:03,727 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1298#true} {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:03,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret6#1);havoc fmax_float_#t~ret6#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume ~fp.gt~FLOAT(fmax_float_~x#1, fmax_float_~y#1);fmax_float_#t~ite7#1 := fmax_float_~x#1; {1299#false} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {1299#false} fmax_float_#res#1 := fmax_float_#t~ite7#1;havoc fmax_float_#t~ite7#1; {1299#false} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1299#false} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {1299#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1299#false} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {1299#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1299#false} is VALID [2022-02-20 16:47:03,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {1299#false} assume !false; {1299#false} is VALID [2022-02-20 16:47:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:47:03,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:03,730 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:03,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507842577] [2022-02-20 16:47:03,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507842577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:03,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:03,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:47:03,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850068510] [2022-02-20 16:47:03,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:03,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:03,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:03,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:47:03,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:47:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:47:03,749 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,802 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 16:47:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:47:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 16:47:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 16:47:03,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-20 16:47:03,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,837 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:47:03,837 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:47:03,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:47:03,838 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:03,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-20 16:47:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:47:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-02-20 16:47:03,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:03,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,840 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,840 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,841 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:47:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 16:47:03,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 30 states. [2022-02-20 16:47:03,841 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 30 states. [2022-02-20 16:47:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,842 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:47:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 16:47:03,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:03,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:47:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:47:03,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2022-02-20 16:47:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:03,844 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:47:03,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:47:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:47:03,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:03,845 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:03,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:04,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:04,053 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:04,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1034693180, now seen corresponding path program 1 times [2022-02-20 16:47:04,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:04,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473234931] [2022-02-20 16:47:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:04,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:04,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:04,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:47:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:47:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:04,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#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); {1509#true} is VALID [2022-02-20 16:47:04,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,268 INFO L272 TraceCheckUtils]: 2: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {1509#true} is VALID [2022-02-20 16:47:04,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {1509#true} ~x := #in~x;havoc ~w~0; {1509#true} is VALID [2022-02-20 16:47:04,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {1509#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1509#true} is VALID [2022-02-20 16:47:04,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1509#true} goto; {1509#true} is VALID [2022-02-20 16:47:04,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1509#true} is VALID [2022-02-20 16:47:04,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#true} assume true; {1509#true} is VALID [2022-02-20 16:47:04,269 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1509#true} {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,270 INFO L272 TraceCheckUtils]: 10: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {1509#true} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {1509#true} ~x := #in~x;havoc ~w~0; {1509#true} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1509#true} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1509#true} goto; {1509#true} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {1509#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1509#true} is VALID [2022-02-20 16:47:04,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {1509#true} assume true; {1509#true} is VALID [2022-02-20 16:47:04,271 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1509#true} {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret6#1);havoc fmax_float_#t~ret6#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !~fp.gt~FLOAT(fmax_float_~x#1, fmax_float_~y#1);fmax_float_#t~ite7#1 := fmax_float_~y#1; {1569#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_fmax_float_#t~ite7#1|))} is VALID [2022-02-20 16:47:04,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {1569#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_fmax_float_#t~ite7#1|))} fmax_float_#res#1 := fmax_float_#t~ite7#1;havoc fmax_float_#t~ite7#1; {1573#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:04,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {1573#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1577#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:47:04,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {1577#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1581#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:47:04,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {1581#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1510#false} is VALID [2022-02-20 16:47:04,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {1510#false} assume !false; {1510#false} is VALID [2022-02-20 16:47:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:47:04,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:04,281 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:04,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473234931] [2022-02-20 16:47:04,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473234931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:04,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:04,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:47:04,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419666830] [2022-02-20 16:47:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:04,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:04,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:04,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:47:04,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:47:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:47:04,304 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:04,470 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:47:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:47:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-02-20 16:47:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-02-20 16:47:04,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-02-20 16:47:04,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:04,502 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:47:04,503 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:47:04,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:47:04,503 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:04,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:47:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:47:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:47:04,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:04,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:04,506 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:04,506 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:04,506 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:47:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:47:04,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:04,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:04,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:47:04,507 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:47:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:04,508 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:47:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:47:04,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:04,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:04,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:04,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:47:04,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:47:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:04,510 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:47:04,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:47:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:47:04,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:04,510 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:04,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:04,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:04,711 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash -881640172, now seen corresponding path program 1 times [2022-02-20 16:47:04,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:04,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356084604] [2022-02-20 16:47:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:04,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:04,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:04,713 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:04,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:47:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:47:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:04,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#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); {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L272 TraceCheckUtils]: 2: Hoare triple {1699#true} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {1699#true} ~x := #in~x;havoc ~w~0; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {1699#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1699#true} goto; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {1699#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1699#true} assume true; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1699#true} {1699#true} #67#return; {1699#true} is VALID [2022-02-20 16:47:04,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {1699#true} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {1699#true} is VALID [2022-02-20 16:47:04,843 INFO L272 TraceCheckUtils]: 10: Hoare triple {1699#true} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {1699#true} is VALID [2022-02-20 16:47:04,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {1699#true} ~x := #in~x;havoc ~w~0; {1699#true} is VALID [2022-02-20 16:47:04,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {1699#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1699#true} is VALID [2022-02-20 16:47:04,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {1699#true} goto; {1699#true} is VALID [2022-02-20 16:47:04,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {1699#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1699#true} is VALID [2022-02-20 16:47:04,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1699#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {1699#true} is VALID [2022-02-20 16:47:04,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {1699#true} assume (~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32));#res := 3bv32; {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:04,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} assume true; {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:47:04,845 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} {1699#true} #69#return; {1759#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv3 32))} is VALID [2022-02-20 16:47:04,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1759#(= |ULTIMATE.start_fmax_float_#t~ret6#1| (_ bv3 32))} assume 0bv32 == fmax_float_#t~ret6#1;havoc fmax_float_#t~ret6#1;fmax_float_#res#1 := fmax_float_~x#1; {1700#false} is VALID [2022-02-20 16:47:04,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {1700#false} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1700#false} is VALID [2022-02-20 16:47:04,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1700#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1700#false} is VALID [2022-02-20 16:47:04,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {1700#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1700#false} is VALID [2022-02-20 16:47:04,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2022-02-20 16:47:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:47:04,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:04,846 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:04,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356084604] [2022-02-20 16:47:04,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356084604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:04,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:04,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:47:04,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151624254] [2022-02-20 16:47:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:04,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:04,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:04,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:47:04,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:47:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:04,874 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:04,973 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:47:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:04,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:47:04,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:47:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:47:04,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 16:47:05,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:05,003 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:47:05,003 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:47:05,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:05,004 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:05,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:47:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:47:05,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:05,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:05,007 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:05,007 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,008 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:47:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:47:05,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:47:05,008 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:47:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,009 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:47:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:47:05,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:05,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:47:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:47:05,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:47:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:05,010 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:47:05,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:47:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:47:05,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:05,015 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:05,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:05,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:05,222 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1550253923, now seen corresponding path program 1 times [2022-02-20 16:47:05,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:05,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806145572] [2022-02-20 16:47:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:05,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:05,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:05,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:47:05,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:47:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:05,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:47:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:05,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:05,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1888#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); {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1888#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_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmax_float } true;fmax_float_#in~x#1, fmax_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_float_#res#1;havoc fmax_float_#t~ret5#1, fmax_float_#t~ret6#1, fmax_float_#t~ite7#1, fmax_float_~x#1, fmax_float_~y#1;fmax_float_~x#1 := fmax_float_#in~x#1;fmax_float_~y#1 := fmax_float_#in~y#1; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:05,390 INFO L272 TraceCheckUtils]: 2: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret5#1 := __fpclassify_float(fmax_float_~x#1); {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {1888#true} ~x := #in~x;havoc ~w~0; {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {1888#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1888#true} goto; {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1888#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1888#true} is VALID [2022-02-20 16:47:05,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1888#true} assume true; {1888#true} is VALID [2022-02-20 16:47:05,391 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1888#true} {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret5#1);havoc fmax_float_#t~ret5#1; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:05,394 INFO L272 TraceCheckUtils]: 10: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmax_float_#t~ret6#1 := __fpclassify_float(fmax_float_~y#1); {1888#true} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {1888#true} ~x := #in~x;havoc ~w~0; {1888#true} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {1888#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1888#true} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1888#true} goto; {1888#true} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1888#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1888#true} is VALID [2022-02-20 16:47:05,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {1888#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {1888#true} is VALID [2022-02-20 16:47:05,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1888#true} assume !((~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32))); {1888#true} is VALID [2022-02-20 16:47:05,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {1888#true} assume !(2139095040bv32 == ~w~0 || 4286578688bv32 == ~w~0);#res := 0bv32; {1888#true} is VALID [2022-02-20 16:47:05,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {1888#true} assume true; {1888#true} is VALID [2022-02-20 16:47:05,395 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1888#true} {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:05,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmax_float_#t~ret6#1;havoc fmax_float_#t~ret6#1;fmax_float_#res#1 := fmax_float_~x#1; {1954#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:05,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {1954#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmax_float_#res#1;assume { :end_inline_fmax_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 !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1958#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:47:05,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {1958#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1962#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:47:05,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1889#false} is VALID [2022-02-20 16:47:05,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {1889#false} assume !false; {1889#false} is VALID [2022-02-20 16:47:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:47:05,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:05,398 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:05,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806145572] [2022-02-20 16:47:05,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806145572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:05,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:05,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:47:05,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561954539] [2022-02-20 16:47:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:47:05,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:05,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:05,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:47:05,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:05,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:47:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:47:05,419 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,523 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:47:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:47:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:47:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:47:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:47:05,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 16:47:05,547 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:47:05,547 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:47:05,547 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:47:05,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:47:05,548 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:05,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:47:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:47:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:47:05,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:05,548 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:47:05,548 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:47:05,548 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:47:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,549 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,549 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:47:05,549 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:47:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,549 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:05,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:05,549 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:47:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:47:05,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:47:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:05,550 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:47:05,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:47:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,552 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:47:05,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:47:05,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:47:05,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L854 garLoopResultBuilder]: At program point L52-3(lines 44 53) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) [2022-02-20 16:47:05,815 INFO L861 garLoopResultBuilder]: At program point L71(lines 58 72) the Hoare annotation is: true [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:47:05,815 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 51) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L45-1(lines 45 47) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatFINAL(lines 21 42) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 41) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 41) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L24-1(lines 24 28) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L861 garLoopResultBuilder]: At program point L24-2(lines 24 28) the Hoare annotation is: true [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 21 42) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L861 garLoopResultBuilder]: At program point __fpclassify_floatENTRY(lines 21 42) the Hoare annotation is: true [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatEXIT(lines 21 42) no Hoare annotation was computed. [2022-02-20 16:47:05,816 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 41) no Hoare annotation was computed. [2022-02-20 16:47:05,819 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:05,819 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:47:05,821 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-02-20 16:47:05,822 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-02-20 16:47:05,823 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2022-02-20 16:47:05,823 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:47:05,823 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:47:05,824 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:47:05,824 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:47:05,825 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:05,826 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:05,826 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:47:05,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:47:05,831 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:47:05,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:05 BoogieIcfgContainer [2022-02-20 16:47:05,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:05,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:05,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:05,832 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:05,833 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:59" (3/4) ... [2022-02-20 16:47:05,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:47:05,838 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2022-02-20 16:47:05,840 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:47:05,840 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:47:05,840 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:47:05,841 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:47:05,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:47:05,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:47:05,860 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:47:05,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:05,861 INFO L158 Benchmark]: Toolchain (without parser) took 6710.41ms. Allocated memory was 50.3MB in the beginning and 75.5MB in the end (delta: 25.2MB). Free memory was 26.2MB in the beginning and 50.2MB in the end (delta: -23.9MB). Peak memory consumption was 130.3kB. Max. memory is 16.1GB. [2022-02-20 16:47:05,861 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:05,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.53ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.0MB in the beginning and 42.9MB in the end (delta: -16.9MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.12ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 41.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,861 INFO L158 Benchmark]: Boogie Preprocessor took 33.26ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 39.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,862 INFO L158 Benchmark]: RCFGBuilder took 239.30ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 43.3MB in the end (delta: -3.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,862 INFO L158 Benchmark]: TraceAbstraction took 6101.58ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 53.5MB in the end (delta: -10.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,862 INFO L158 Benchmark]: Witness Printer took 27.88ms. Allocated memory is still 75.5MB. Free memory was 52.9MB in the beginning and 50.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:05,863 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.17ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.53ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.0MB in the beginning and 42.9MB in the end (delta: -16.9MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.12ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 41.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.26ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 39.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.30ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 43.3MB in the end (delta: -3.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6101.58ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 53.5MB in the end (delta: -10.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 27.88ms. Allocated memory is still 75.5MB. Free memory was 52.9MB in the beginning and 50.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation 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: 67]: 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 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 891 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 308 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 43 HoareAnnotationTreeSize, 11 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 20 QuantifiedInterpolants, 374 SizeOfPredicates, 32 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 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: 56]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 44]: Loop Invariant [2022-02-20 16:47:05,868 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:47:05,868 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:47:05,890 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