./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1130b.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_1130b.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 a27d491922fed811389be7683fdd773e450b51244c11daaa0217b4a945b5d2e5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:25,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:25,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:25,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:25,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:25,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:25,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:25,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:25,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:25,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:25,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:25,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:25,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:25,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:25,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:25,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:25,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:25,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:25,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:25,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:25,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:25,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:25,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:25,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:25,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:25,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:25,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:25,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:25,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:25,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:25,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:25,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:25,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:25,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:25,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:25,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:25,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:25,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:25,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:25,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:25,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:25,764 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:25,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:25,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:25,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:25,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:25,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:25,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:25,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:25,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:25,791 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:25,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:25,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:25,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:25,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:25,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:25,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:25,795 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:25,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:25,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:25,795 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 -> a27d491922fed811389be7683fdd773e450b51244c11daaa0217b4a945b5d2e5 [2022-02-20 16:46:25,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:26,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:26,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:26,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:26,008 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:26,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1130b.c [2022-02-20 16:46:26,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0455726/1eba5a64ce4241ec955b8864d7d8d65f/FLAG73d723afb [2022-02-20 16:46:26,429 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:26,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1130b.c [2022-02-20 16:46:26,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0455726/1eba5a64ce4241ec955b8864d7d8d65f/FLAG73d723afb [2022-02-20 16:46:26,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0455726/1eba5a64ce4241ec955b8864d7d8d65f [2022-02-20 16:46:26,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:26,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:26,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:26,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:26,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:26,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:26,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1649af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26, skipping insertion in model container [2022-02-20 16:46:26,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:26,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:26,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:27,158 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_1130b.c[2909,2922] [2022-02-20 16:46:27,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:27,168 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:27,209 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_1130b.c[2909,2922] [2022-02-20 16:46:27,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:27,230 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:27,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:27 WrapperNode [2022-02-20 16:46:27,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:27,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:27,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:27,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:27,236 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:27" (1/1) ... [2022-02-20 16:46:27,255 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:27" (1/1) ... [2022-02-20 16:46:27,291 INFO L137 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 223 [2022-02-20 16:46:27,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:27,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:27,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:27,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:27,300 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:27" (1/1) ... [2022-02-20 16:46:27,300 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:27" (1/1) ... [2022-02-20 16:46:27,310 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:27" (1/1) ... [2022-02-20 16:46:27,310 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:27" (1/1) ... [2022-02-20 16:46:27,317 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:27" (1/1) ... [2022-02-20 16:46:27,326 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:27" (1/1) ... [2022-02-20 16:46:27,328 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:27" (1/1) ... [2022-02-20 16:46:27,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:27,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:27,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:27,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:27,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:27" (1/1) ... [2022-02-20 16:46:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:27,361 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:27,367 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:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:27,451 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:27,452 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:27,824 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:27,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:27,833 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:27,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:27 BoogieIcfgContainer [2022-02-20 16:46:27,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:27,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:27,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:27,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:27,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:26" (1/3) ... [2022-02-20 16:46:27,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767356ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:27, skipping insertion in model container [2022-02-20 16:46:27,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:27" (2/3) ... [2022-02-20 16:46:27,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767356ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:27, skipping insertion in model container [2022-02-20 16:46:27,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:27" (3/3) ... [2022-02-20 16:46:27,841 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1130b.c [2022-02-20 16:46:27,847 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:27,848 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:27,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:27,892 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:27,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 58 states have (on average 1.793103448275862) internal successors, (104), 59 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:27,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:27,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:27,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -682512150, now seen corresponding path program 1 times [2022-02-20 16:46:27,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:27,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509204153] [2022-02-20 16:46:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:28,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {63#true} is VALID [2022-02-20 16:46:28,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);main_~y~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {63#true} is VALID [2022-02-20 16:46:28,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0) || ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0);assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {63#true} is VALID [2022-02-20 16:46:28,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#true} assume !true; {64#false} is VALID [2022-02-20 16:46:28,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#false} assume !true; {64#false} is VALID [2022-02-20 16:46:28,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {64#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {64#false} is VALID [2022-02-20 16:46:28,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {64#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {64#false} is VALID [2022-02-20 16:46:28,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {64#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {64#false} is VALID [2022-02-20 16:46:28,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {64#false} main_#t~ret17#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;main_#t~short19#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {64#false} is VALID [2022-02-20 16:46:28,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {64#false} assume !main_#t~short19#1; {64#false} is VALID [2022-02-20 16:46:28,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {64#false} assume !main_#t~short19#1;havoc main_#t~ret18#1;havoc main_#t~short19#1; {64#false} is VALID [2022-02-20 16:46:28,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-02-20 16:46:28,094 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:28,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:28,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509204153] [2022-02-20 16:46:28,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509204153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:28,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:28,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:28,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889813801] [2022-02-20 16:46:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:28,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:28,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:28,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:28,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:28,148 INFO L87 Difference]: Start difference. First operand has 60 states, 58 states have (on average 1.793103448275862) internal successors, (104), 59 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,258 INFO L93 Difference]: Finished difference Result 117 states and 204 transitions. [2022-02-20 16:46:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 16:46:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 16:46:28,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 204 transitions. [2022-02-20 16:46:28,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:28,463 INFO L225 Difference]: With dead ends: 117 [2022-02-20 16:46:28,463 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 16:46:28,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:28,467 INFO L933 BasicCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:28,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 16:46:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 16:46:28,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:28,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,493 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,494 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,497 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-02-20 16:46:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 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 56 states. [2022-02-20 16:46:28,500 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 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 56 states. [2022-02-20 16:46:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,503 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-02-20 16:46:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:28,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-02-20 16:46:28,507 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 12 [2022-02-20 16:46:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:28,507 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-02-20 16:46:28,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:28,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:28,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:28,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:28,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 337837613, now seen corresponding path program 1 times [2022-02-20 16:46:28,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:28,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997109120] [2022-02-20 16:46:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:28,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:28,638 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:28,638 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:28,640 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:28,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:28,643 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:28,645 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,664 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,665 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,666 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:28,667 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:28,668 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,669 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,670 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,671 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,672 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,673 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:28,674 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,675 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,675 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:28,675 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:28,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:28 BoogieIcfgContainer [2022-02-20 16:46:28,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:28,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:28,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:28,677 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:28,677 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:27" (3/4) ... [2022-02-20 16:46:28,679 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:28,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:28,681 INFO L158 Benchmark]: Toolchain (without parser) took 1857.39ms. Allocated memory is still 121.6MB. Free memory was 88.2MB in the beginning and 55.3MB in the end (delta: 32.9MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,681 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 81.8MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:28,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.12ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 92.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.64ms. Allocated memory is still 121.6MB. Free memory was 92.9MB in the beginning and 89.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,682 INFO L158 Benchmark]: Boogie Preprocessor took 35.87ms. Allocated memory is still 121.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,682 INFO L158 Benchmark]: RCFGBuilder took 504.33ms. Allocated memory is still 121.6MB. Free memory was 87.2MB in the beginning and 63.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,683 INFO L158 Benchmark]: TraceAbstraction took 839.92ms. Allocated memory is still 121.6MB. Free memory was 62.7MB in the beginning and 55.3MB in the end (delta: 7.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,683 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 121.6MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:28,685 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.13ms. Allocated memory is still 81.8MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.12ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 92.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.64ms. Allocated memory is still 121.6MB. Free memory was 92.9MB in the beginning and 89.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.87ms. Allocated memory is still 121.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.33ms. Allocated memory is still 121.6MB. Free memory was 87.2MB in the beginning and 63.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 839.92ms. Allocated memory is still 121.6MB. Free memory was 62.7MB in the beginning and 55.3MB in the end (delta: 7.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 121.6MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 137]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of someUnaryFLOAToperation at line 128, overapproximation of bitwiseXOr at line 33, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L128] float x = -0.0f; [L129] float y = __VERIFIER_nondet_float(); [L131] COND TRUE (y < 0.0f || y > 0.0f) [L133] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967296, \old(y)=4294967297, one_fmod=1, x=4294967296, y=4294967297, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967296, \old(y)=4294967297, hx=0, hy=-1, one_fmod=1, sx=0, x=4294967296, y=4294967297, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967296, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967296, y=4294967297, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967296, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967296, y=4294967297, Zero_fmod={4:0}] [L133] RET, EXPR fmod_float(x, y) [L133] float res = fmod_float(x, y); [L136] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [one_fmod=1, res=4294967298, res == -0.0f && __signbit_float(res) == 1=0, x=4294967296, y=4294967297, Zero_fmod={4:0}] [L136] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L137] reach_error() VAL [one_fmod=1, res=4294967298, x=4294967296, y=4294967297, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 81 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:28,713 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_1130b.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 a27d491922fed811389be7683fdd773e450b51244c11daaa0217b4a945b5d2e5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:30,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:30,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:30,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:30,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:30,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:30,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:30,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:30,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:30,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:30,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:30,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:30,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:30,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:30,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:30,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:30,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:30,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:30,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:30,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:30,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:30,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:30,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:30,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:30,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:30,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:30,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:30,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:30,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:30,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:30,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:30,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:30,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:30,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:30,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:30,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:30,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:30,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:30,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:30,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:30,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:30,427 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:30,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:30,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:30,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:30,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:30,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:30,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:30,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:30,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:30,455 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:30,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:30,456 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:30,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:30,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:30,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:30,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:30,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:30,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:30,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:30,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:30,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:30,460 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 -> a27d491922fed811389be7683fdd773e450b51244c11daaa0217b4a945b5d2e5 [2022-02-20 16:46:30,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:30,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:30,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:30,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:30,732 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:30,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1130b.c [2022-02-20 16:46:30,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78926546b/e82327365d88470e874321f6687f7491/FLAGdb450a722 [2022-02-20 16:46:31,106 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:31,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1130b.c [2022-02-20 16:46:31,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78926546b/e82327365d88470e874321f6687f7491/FLAGdb450a722 [2022-02-20 16:46:31,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78926546b/e82327365d88470e874321f6687f7491 [2022-02-20 16:46:31,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:31,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:31,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:31,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:31,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d83b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:31,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:31,709 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_1130b.c[2909,2922] [2022-02-20 16:46:31,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,738 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:31,853 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_1130b.c[2909,2922] [2022-02-20 16:46:31,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,869 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:31,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31 WrapperNode [2022-02-20 16:46:31,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:31,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:31,880 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:31" (1/1) ... [2022-02-20 16:46:31,897 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:31" (1/1) ... [2022-02-20 16:46:31,930 INFO L137 Inliner]: procedures = 21, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 187 [2022-02-20 16:46:31,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:31,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:31,938 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:31" (1/1) ... [2022-02-20 16:46:31,939 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:31" (1/1) ... [2022-02-20 16:46:31,953 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:31" (1/1) ... [2022-02-20 16:46:31,954 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:31" (1/1) ... [2022-02-20 16:46:31,966 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:31" (1/1) ... [2022-02-20 16:46:31,974 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:31" (1/1) ... [2022-02-20 16:46:31,978 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:31" (1/1) ... [2022-02-20 16:46:31,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:31,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:31,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:31,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:32,027 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:32,036 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:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:32,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:32,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:32,159 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:32,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:35,014 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:35,019 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:35,020 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:35,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35 BoogieIcfgContainer [2022-02-20 16:46:35,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:35,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:35,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:35,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:35,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:31" (1/3) ... [2022-02-20 16:46:35,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1e2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (2/3) ... [2022-02-20 16:46:35,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1e2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35" (3/3) ... [2022-02-20 16:46:35,027 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1130b.c [2022-02-20 16:46:35,030 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:35,031 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:35,067 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:35,073 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:35,074 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:35,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:35,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:35,091 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 461941989, now seen corresponding path program 1 times [2022-02-20 16:46:35,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:35,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822480426] [2022-02-20 16:46:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:35,125 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:35,126 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:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:35,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {51#true} is VALID [2022-02-20 16:46:35,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {51#true} is VALID [2022-02-20 16:46:35,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {51#true} is VALID [2022-02-20 16:46:35,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#true} assume !true; {51#true} is VALID [2022-02-20 16:46:35,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-02-20 16:46:35,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {52#false} is VALID [2022-02-20 16:46:35,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {52#false} is VALID [2022-02-20 16:46:35,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {52#false} is VALID [2022-02-20 16:46:35,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#false} assume !main_#t~short16#1; {52#false} is VALID [2022-02-20 16:46:35,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {52#false} is VALID [2022-02-20 16:46:35,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-02-20 16:46:35,429 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:35,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:35,430 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:35,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822480426] [2022-02-20 16:46:35,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822480426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:35,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:35,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:35,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975844937] [2022-02-20 16:46:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:35,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:35,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:35,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:35,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:35,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:35,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:35,762 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,151 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2022-02-20 16:46:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:46:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:46:38,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 156 transitions. [2022-02-20 16:46:38,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:38,799 INFO L225 Difference]: With dead ends: 93 [2022-02-20 16:46:38,799 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:38,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:38,804 INFO L933 BasicCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:38,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:38,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:38,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,827 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,828 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,830 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-02-20 16:46:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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 44 states. [2022-02-20 16:46:38,832 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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 44 states. [2022-02-20 16:46:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,834 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-02-20 16:46:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:38,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 16:46:38,853 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 11 [2022-02-20 16:46:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:38,853 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 16:46:38,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:38,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:38,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:39,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1049045826, now seen corresponding path program 1 times [2022-02-20 16:46:39,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:39,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388718043] [2022-02-20 16:46:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:39,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:39,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:39,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 16:46:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:39,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-02-20 16:46:40,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {342#true} is VALID [2022-02-20 16:46:40,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {350#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:40,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {354#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} is VALID [2022-02-20 16:46:40,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {354#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {358#(and (exists ((|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} is VALID [2022-02-20 16:46:40,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {358#(and (exists ((|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} goto; {358#(and (exists ((|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} is VALID [2022-02-20 16:46:40,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#(and (exists ((|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {365#(and (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24))) (or (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:40,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(and (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24))) (or (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))))} goto; {365#(and (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24))) (or (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:40,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(and (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24))) (or (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {372#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|) (or (fp.gt (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (_ +zero 8 24)) (fp.lt (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:46:40,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|) (or (fp.gt (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (_ +zero 8 24)) (fp.lt (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (_ +zero 8 24))))))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {343#false} is VALID [2022-02-20 16:46:40,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {343#false} is VALID [2022-02-20 16:46:40,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#false} assume !main_#t~short16#1; {343#false} is VALID [2022-02-20 16:46:40,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {343#false} is VALID [2022-02-20 16:46:40,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 16:46:40,315 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:40,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:40,315 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:40,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388718043] [2022-02-20 16:46:40,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388718043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:40,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:40,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:40,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249674338] [2022-02-20 16:46:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:40,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:40,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,556 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:46:40,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:40,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:40,558 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,657 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 16:46:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:46:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:46:42,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-20 16:46:42,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,996 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:46:42,996 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:42,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:42,997 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 240 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 55 Unchecked, 0.5s Time] [2022-02-20 16:46:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:43,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:43,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,000 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,001 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:43,002 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:46:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:43,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:43,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:43,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 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 44 states. [2022-02-20 16:46:43,004 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 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 44 states. [2022-02-20 16:46:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:43,005 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:46:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:43,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:43,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:43,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:43,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-20 16:46:43,008 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 13 [2022-02-20 16:46:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:43,009 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-20 16:46:43,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:43,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:43,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:43,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:43,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:43,222 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1911951893, now seen corresponding path program 1 times [2022-02-20 16:46:43,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:43,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902940414] [2022-02-20 16:46:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:43,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:43,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:43,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:43,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:43,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:46:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:43,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:43,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {599#true} is VALID [2022-02-20 16:46:43,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {607#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:43,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} goto; {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} goto; {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:43,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {633#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_fmod_float_#res#1|)} is VALID [2022-02-20 16:46:43,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_fmod_float_#res#1|)} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {637#|ULTIMATE.start_main_#t~short16#1|} is VALID [2022-02-20 16:46:43,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#|ULTIMATE.start_main_#t~short16#1|} assume !main_#t~short16#1; {600#false} is VALID [2022-02-20 16:46:43,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {600#false} is VALID [2022-02-20 16:46:43,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 16:46:43,488 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:43,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:43,489 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:43,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902940414] [2022-02-20 16:46:43,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902940414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:43,489 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:43,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:43,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22132524] [2022-02-20 16:46:43,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:43,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:43,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,505 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:43,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:43,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:43,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:43,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:43,506 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:45,340 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 16:46:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-20 16:46:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-20 16:46:45,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-02-20 16:46:45,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:45,473 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:46:45,473 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:46:45,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:45,474 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:45,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 169 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 16:46:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:46:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2022-02-20 16:46:45,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:45,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,478 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,478 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:45,482 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-02-20 16:46:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-20 16:46:45,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:45,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:45,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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 62 states. [2022-02-20 16:46:45,485 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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 62 states. [2022-02-20 16:46:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:45,487 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-02-20 16:46:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-20 16:46:45,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:45,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:45,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:45,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-02-20 16:46:45,503 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 14 [2022-02-20 16:46:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:45,504 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-02-20 16:46:45,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-02-20 16:46:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:45,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:45,508 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:45,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:45,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:45,709 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash 791016935, now seen corresponding path program 1 times [2022-02-20 16:46:45,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:45,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692204831] [2022-02-20 16:46:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:45,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:45,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:45,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:45,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:46,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {918#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {918#true} is VALID [2022-02-20 16:46:46,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {918#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {926#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:46,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {926#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {930#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:46,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:46,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:46,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:46,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:46,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {947#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} is VALID [2022-02-20 16:46:46,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {951#(and (not (= (_ bv0 32) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} is VALID [2022-02-20 16:46:46,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {951#(and (not (= (_ bv0 32) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {951#(and (not (= (_ bv0 32) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} is VALID [2022-02-20 16:46:46,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {951#(and (not (= (_ bv0 32) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (and (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_36|))))) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} assume fmod_float_~hx~0#1 == fmod_float_~hy~0#1;call fmod_float_#t~mem6#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem6#1;havoc fmod_float_#t~mem6#1; {919#false} is VALID [2022-02-20 16:46:46,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {919#false} is VALID [2022-02-20 16:46:46,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {919#false} assume !main_#t~short16#1; {919#false} is VALID [2022-02-20 16:46:46,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {919#false} is VALID [2022-02-20 16:46:46,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#false} assume !false; {919#false} is VALID [2022-02-20 16:46:46,184 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:46,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:46,184 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:46,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692204831] [2022-02-20 16:46:46,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692204831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:46,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:46,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:46,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431636037] [2022-02-20 16:46:46,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:46,185 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:46,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:46,185 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:46,204 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:46,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:46,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:46,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:46,205 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,600 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-02-20 16:46:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:48,600 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:48,600 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-02-20 16:46:48,601 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-02-20 16:46:48,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-02-20 16:46:48,708 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:46:48,709 INFO L225 Difference]: With dead ends: 55 [2022-02-20 16:46:48,709 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:46:48,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:48,710 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:48,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 231 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-02-20 16:46:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:46:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:46:48,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:48,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,714 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,714 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,715 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 16:46:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 16:46:48,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 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 46 states. [2022-02-20 16:46:48,722 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 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 46 states. [2022-02-20 16:46:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,723 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 16:46:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 16:46:48,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:48,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 16:46:48,730 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 15 [2022-02-20 16:46:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:48,730 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 16:46:48,730 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 16:46:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:48,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:48,731 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:48,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:48,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -645654976, now seen corresponding path program 1 times [2022-02-20 16:46:48,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:48,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505566289] [2022-02-20 16:46:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:48,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:48,943 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:46:48,945 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:46:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:49,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {1193#true} is VALID [2022-02-20 16:46:49,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1201#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:49,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1201#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} goto; {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} goto; {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1205#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {1227#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_fmod_float_#res#1|)} is VALID [2022-02-20 16:46:49,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_fmod_float_#res#1|)} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1231#(= |ULTIMATE.start_main_~res~0#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:49,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {1231#(= |ULTIMATE.start_main_~res~0#1| (fp.neg (_ +zero 8 24)))} assume main_#t~short16#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem12#1, __signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {1235#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___signbit_float_~x#1|)} is VALID [2022-02-20 16:46:49,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___signbit_float_~x#1|)} call __signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset, 4bv32);call __signbit_float_#t~mem12#1 := read~intINTTYPE4(__signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem12#1;havoc __signbit_float_#t~mem12#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset);havoc __signbit_float_~#gf_u~2#1.base, __signbit_float_~#gf_u~2#1.offset; {1239#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:46:49,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {1239#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} goto; {1239#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:46:49,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {1246#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:46:49,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {1246#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} main_#t~ret15#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short16#1 := 1bv32 == main_#t~ret15#1; {1250#|ULTIMATE.start_main_#t~short16#1|} is VALID [2022-02-20 16:46:49,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1250#|ULTIMATE.start_main_#t~short16#1|} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1194#false} is VALID [2022-02-20 16:46:49,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1194#false} assume !false; {1194#false} is VALID [2022-02-20 16:46:49,484 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:49,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:49,484 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:49,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505566289] [2022-02-20 16:46:49,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505566289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:49,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:49,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:49,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919269403] [2022-02-20 16:46:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:49,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:49,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:49,503 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:49,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:49,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:49,504 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,531 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 16:46:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:46:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 16:46:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 16:46:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 16:46:52,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2022-02-20 16:46:52,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:52,636 INFO L225 Difference]: With dead ends: 62 [2022-02-20 16:46:52,636 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:46:52,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-02-20 16:46:52,637 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 141 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:52,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 366 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:46:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:46:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-02-20 16:46:52,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:52,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,641 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,641 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,642 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 16:46:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 16:46:52,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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 53 states. [2022-02-20 16:46:52,643 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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 53 states. [2022-02-20 16:46:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,644 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 16:46:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 16:46:52,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:52,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2022-02-20 16:46:52,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 18 [2022-02-20 16:46:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:52,646 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2022-02-20 16:46:52,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 16:46:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:52,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:52,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:52,655 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:46:52,847 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:46:52,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1896589553, now seen corresponding path program 1 times [2022-02-20 16:46:52,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:52,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518998985] [2022-02-20 16:46:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:52,850 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:46:52,851 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:46:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:53,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {1510#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {1510#true} is VALID [2022-02-20 16:46:53,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1518#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:53,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1518#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {1522#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:53,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1522#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:53,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:53,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:53,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:53,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} is VALID [2022-02-20 16:46:53,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} is VALID [2022-02-20 16:46:53,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} is VALID [2022-02-20 16:46:53,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} is VALID [2022-02-20 16:46:53,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1539#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|)) (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start_fmod_float_~hx~0#1| (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_37| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_37|))))} assume !~bvslt32(fmod_float_~hx~0#1, 8388608bv32);fmod_float_~ix~0#1 := ~bvsub32(~bvashr32(fmod_float_~hx~0#1, 23bv32), 127bv32); {1511#false} is VALID [2022-02-20 16:46:53,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {1511#false} assume !~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := ~bvsub32(~bvashr32(fmod_float_~hy~0#1, 23bv32), 127bv32); {1511#false} is VALID [2022-02-20 16:46:53,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {1511#false} is VALID [2022-02-20 16:46:53,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1511#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {1511#false} is VALID [2022-02-20 16:46:53,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1511#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {1511#false} is VALID [2022-02-20 16:46:53,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {1511#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {1511#false} is VALID [2022-02-20 16:46:53,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {1511#false} assume !!(0bv32 != fmod_float_#t~post7#1);havoc fmod_float_#t~post7#1;fmod_float_~hz~0#1 := ~bvsub32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {1511#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {1511#false} assume 0bv32 == fmod_float_~hz~0#1;call fmod_float_#t~mem8#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem8#1;havoc fmod_float_#t~mem8#1; {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {1511#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {1511#false} assume !main_#t~short16#1; {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {1511#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1511#false} is VALID [2022-02-20 16:46:53,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-02-20 16:46:53,343 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:53,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:53,343 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:53,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518998985] [2022-02-20 16:46:53,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518998985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:53,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:53,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:53,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544458806] [2022-02-20 16:46:53,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:46:53,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:53,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:53,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:53,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:53,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:53,384 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,745 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-02-20 16:46:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:46:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-02-20 16:46:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-02-20 16:46:55,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2022-02-20 16:46:55,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,878 INFO L225 Difference]: With dead ends: 74 [2022-02-20 16:46:55,878 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:55,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:55,879 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 201 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 21 Unchecked, 0.4s Time] [2022-02-20 16:46:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:55,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,882 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,882 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,883 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:46:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:46:55,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 44 states. [2022-02-20 16:46:55,883 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 44 states. [2022-02-20 16:46:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,884 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:46:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:46:55,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-02-20 16:46:55,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 24 [2022-02-20 16:46:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,886 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-02-20 16:46:55,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:46:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:55,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,897 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:46:56,095 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:46:56,095 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1844332961, now seen corresponding path program 1 times [2022-02-20 16:46:56,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:56,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153080230] [2022-02-20 16:46:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:56,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:56,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:56,098 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:46:56,100 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:46:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:56,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {1827#true} is VALID [2022-02-20 16:46:56,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1835#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:56,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1835#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {1839#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:56,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {1839#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:56,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:56,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:56,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:56,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1843#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {1856#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1856#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:46:56,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:46:56,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume ~bvslt32(fmod_float_~hx~0#1, 8388608bv32);fmod_float_~ix~0#1 := 4294967170bv32;fmod_float_~i~0#1 := ~bvshl32(fmod_float_~hx~0#1, 8bv32); {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:46:56,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume !~bvsgt32(fmod_float_~i~0#1, 0bv32); {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_38|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume !~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := ~bvsub32(~bvashr32(fmod_float_~hy~0#1, 23bv32), 127bv32); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {1828#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1828#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#false} assume !!(0bv32 != fmod_float_#t~post7#1);havoc fmod_float_#t~post7#1;fmod_float_~hz~0#1 := ~bvsub32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#false} assume 0bv32 == fmod_float_~hz~0#1;call fmod_float_#t~mem8#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem8#1;havoc fmod_float_#t~mem8#1; {1828#false} is VALID [2022-02-20 16:46:56,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {1828#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1828#false} is VALID [2022-02-20 16:46:56,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {1828#false} assume !main_#t~short16#1; {1828#false} is VALID [2022-02-20 16:46:56,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1828#false} is VALID [2022-02-20 16:46:56,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-02-20 16:46:56,686 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:56,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:56,686 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:56,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153080230] [2022-02-20 16:46:56,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153080230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:56,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:56,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:56,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697148781] [2022-02-20 16:46:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:46:56,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:56,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:56,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:56,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:56,718 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,137 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-02-20 16:46:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:59,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:46:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 16:46:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 16:46:59,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-02-20 16:46:59,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:59,272 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:46:59,272 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:59,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:59,273 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:59,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 230 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 34 Unchecked, 0.4s Time] [2022-02-20 16:46:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:59,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:59,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,276 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,276 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,277 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 16:46:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 16:46:59,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:59,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:59,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 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 44 states. [2022-02-20 16:46:59,278 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 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 44 states. [2022-02-20 16:46:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,279 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 16:46:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 16:46:59,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:59,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:59,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:59,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-20 16:46:59,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 25 [2022-02-20 16:46:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:59,281 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-20 16:46:59,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 16:46:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:46:59,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:59,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:59,293 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:46:59,491 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:46:59,491 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 101160342, now seen corresponding path program 1 times [2022-02-20 16:46:59,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:59,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44532030] [2022-02-20 16:46:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:59,493 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:46:59,495 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:46:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:46:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {2144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {2144#true} is VALID [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2144#true} is VALID [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2144#true} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {2144#true} is VALID [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {2144#true} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {2144#true} is VALID [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {2144#true} goto; {2144#true} is VALID [2022-02-20 16:46:59,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {2144#true} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {2144#true} is VALID [2022-02-20 16:46:59,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {2144#true} goto; {2144#true} is VALID [2022-02-20 16:46:59,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2144#true} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume ~bvslt32(fmod_float_~hx~0#1, 8388608bv32);fmod_float_~ix~0#1 := 4294967170bv32;fmod_float_~i~0#1 := ~bvshl32(fmod_float_~hx~0#1, 8bv32); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume !~bvsgt32(fmod_float_~i~0#1, 0bv32); {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} is VALID [2022-02-20 16:46:59,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {2170#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) |ULTIMATE.start_fmod_float_~hy~0#1|))} assume ~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := 4294967170bv32;fmod_float_~i~0#1 := ~bvshl32(fmod_float_~hy~0#1, 8bv32); {2189#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) (_ bv8388608 32)) (= (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) (_ bv8 32)) |ULTIMATE.start_fmod_float_~i~0#1|)))} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {2189#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_23| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) (_ bv8388608 32)) (= (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_23|) (_ bv8 32)) |ULTIMATE.start_fmod_float_~i~0#1|)))} assume !~bvsge32(fmod_float_~i~0#1, 0bv32); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {2145#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {2145#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {2145#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {2145#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {2145#false} assume !!(0bv32 != fmod_float_#t~post7#1);havoc fmod_float_#t~post7#1;fmod_float_~hz~0#1 := ~bvsub32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {2145#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {2145#false} assume 0bv32 == fmod_float_~hz~0#1;call fmod_float_#t~mem8#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem8#1;havoc fmod_float_#t~mem8#1; {2145#false} is VALID [2022-02-20 16:46:59,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {2145#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {2145#false} is VALID [2022-02-20 16:46:59,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {2145#false} assume !main_#t~short16#1; {2145#false} is VALID [2022-02-20 16:46:59,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {2145#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {2145#false} is VALID [2022-02-20 16:46:59,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {2145#false} assume !false; {2145#false} is VALID [2022-02-20 16:46:59,774 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,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:59,774 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:59,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44532030] [2022-02-20 16:46:59,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44532030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:59,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:59,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:59,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733440804] [2022-02-20 16:46:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:59,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:46:59,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:59,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:59,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:59,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:59,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:59,836 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,683 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-02-20 16:47:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:47:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:47:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 16:47:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 16:47:03,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-02-20 16:47:03,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,825 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:47:03,825 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:47:03,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:47:03,826 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:03,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-02-20 16:47:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:47:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 16:47:03,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:03,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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:03,834 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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:03,839 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,840 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 16:47:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 16:47:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:47:03,849 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:47:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,850 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 16:47:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 16:47:03,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:03,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-02-20 16:47:03,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 26 [2022-02-20 16:47:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:03,851 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-02-20 16:47:03,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 16:47:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:47:03,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:03,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:03,869 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,061 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,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash 305949144, now seen corresponding path program 1 times [2022-02-20 16:47:04,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:04,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490285604] [2022-02-20 16:47:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:04,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:04,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:04,064 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,065 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,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:47:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:04,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:05,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {2461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {2461#true} is VALID [2022-02-20 16:47:05,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {2461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2469#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:47:05,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {2469#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)} assume ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) || ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {2473#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:47:05,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {2473#(= |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:47:05,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:47:05,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:47:05,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:47:05,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {2477#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|)) (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {2490#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))))))} is VALID [2022-02-20 16:47:05,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {2490#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {2490#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))))))} is VALID [2022-02-20 16:47:05,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2490#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hx~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:47:05,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:47:05,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume ~bvslt32(fmod_float_~hx~0#1, 8388608bv32);fmod_float_~ix~0#1 := 4294967170bv32;fmod_float_~i~0#1 := ~bvshl32(fmod_float_~hx~0#1, 8bv32); {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:47:05,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume !~bvsgt32(fmod_float_~i~0#1, 0bv32); {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} is VALID [2022-02-20 16:47:05,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2497#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (= |ULTIMATE.start_fmod_float_~hy~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))} assume ~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := 4294967170bv32;fmod_float_~i~0#1 := ~bvshl32(fmod_float_~hy~0#1, 8bv32); {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:47:05,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} assume !!~bvsge32(fmod_float_~i~0#1, 0bv32);fmod_float_~iy~0#1 := ~bvsub32(fmod_float_~iy~0#1, 1bv32); {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:47:05,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} fmod_float_~i~0#1 := ~bvshl32(fmod_float_~i~0#1, 1bv32); {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {2510#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|) (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))} assume !~bvsge32(fmod_float_~i~0#1, 0bv32); {2462#false} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {2462#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {2462#false} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {2462#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {2462#false} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {2462#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {2462#false} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {2462#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {2462#false} is VALID [2022-02-20 16:47:05,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {2462#false} assume !!(0bv32 != fmod_float_#t~post7#1);havoc fmod_float_#t~post7#1;fmod_float_~hz~0#1 := ~bvsub32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {2462#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {2462#false} assume 0bv32 == fmod_float_~hz~0#1;call fmod_float_#t~mem8#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem8#1;havoc fmod_float_#t~mem8#1; {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {2462#false} main_#t~ret14#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret14#1;havoc main_#t~ret14#1;main_#t~short16#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {2462#false} assume !main_#t~short16#1; {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {2462#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {2462#false} assume !false; {2462#false} is VALID [2022-02-20 16:47:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:47:05,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:05,048 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:05,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490285604] [2022-02-20 16:47:05,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490285604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:05,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:05,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:47:05,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543649579] [2022-02-20 16:47:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 16:47:05,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:05,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:05,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:05,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:47:05,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:47:05,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:47:05,104 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,481 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 16:47:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:47:05,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 16:47:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-02-20 16:47:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-02-20 16:47:05,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-02-20 16:47:05,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:05,694 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:47:05,694 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:47:05,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:47:05,704 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:05,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-02-20 16:47:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:47:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:47:05,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:05,706 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,706 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,707 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,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,707 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,708 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,708 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,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:05,708 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:05,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:05,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:05,709 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:47:05,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-02-20 16:47:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:05,709 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:47:05,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:05,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:05,712 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:47:05,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 16:47:05,926 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:05,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:47:06,460 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:47:06,460 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:47:06,460 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,460 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:47:06,460 INFO L854 garLoopResultBuilder]: At program point L118(lines 109 119) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) |ULTIMATE.start_main_#t~short16#1| (= .cse0 |ULTIMATE.start_fmod_float_#res#1|) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start___signbit_float_~x#1|) (= .cse0 (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= |ULTIMATE.start_main_~res~0#1| .cse0) (= .cse0 |ULTIMATE.start_main_~x~0#1|))) [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L136-2(lines 136 139) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L854 garLoopResultBuilder]: At program point L112-2(lines 112 116) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) |ULTIMATE.start_main_#t~short16#1| (= .cse0 |ULTIMATE.start_fmod_float_#res#1|) (= .cse0 |ULTIMATE.start___signbit_float_~x#1|) (= |ULTIMATE.start_main_~res~0#1| .cse0) (= .cse0 |ULTIMATE.start_main_~x~0#1|))) [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L112-3(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:47:06,461 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) (or (fp.lt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (fp.gt |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))) (= .cse0 |ULTIMATE.start_main_~x~0#1|))) [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) (= .cse0 |ULTIMATE.start_fmod_float_#res#1|) (= .cse0 |ULTIMATE.start_main_~x~0#1|))) [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L131-2(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:47:06,462 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (and (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) .cse1)) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl .cse1 (_ bv8 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24)))))) (= .cse0 |ULTIMATE.start_main_~x~0#1|))) [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:47:06,463 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:47:06,463 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:06,464 INFO L861 garLoopResultBuilder]: At program point L142(lines 121 143) the Hoare annotation is: true [2022-02-20 16:47:06,464 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:47:06,464 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmod_float_~x#1| .cse0) (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_22| (_ BitVec 32))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_22|) |ULTIMATE.start_fmod_float_~hy~0#1|)) (= .cse0 |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|)) (fp.neg (_ +zero 8 24))) (not (bvslt (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_39|) |ULTIMATE.start_fmod_float_~hy~0#1|)))))) [2022-02-20 16:47:06,472 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:06,473 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:47:06,485 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:47:06,486 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:06,487 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:06,488 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:06,490 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:06,491 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:06,492 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:06,493 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:06,493 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:47:06,511 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,512 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,516 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,522 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] [2022-02-20 16:47:06,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:06 BoogieIcfgContainer [2022-02-20 16:47:06,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:06,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:06,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:06,535 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:06,536 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:35" (3/4) ... [2022-02-20 16:47:06,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:47:06,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 16:47:06,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:47:06,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:47:06,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:47:06,569 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:47:06,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:06,571 INFO L158 Benchmark]: Toolchain (without parser) took 35044.83ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 39.8MB in the beginning and 36.8MB in the end (delta: 2.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,572 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:06,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.94ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 42.2MB in the end (delta: -2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,573 INFO L158 Benchmark]: Boogie Preprocessor took 55.62ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,573 INFO L158 Benchmark]: RCFGBuilder took 3032.90ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 37.1MB in the beginning and 65.3MB in the end (delta: -28.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,574 INFO L158 Benchmark]: TraceAbstraction took 31512.53ms. Allocated memory is still 90.2MB. Free memory was 64.6MB in the beginning and 39.8MB in the end (delta: 24.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,574 INFO L158 Benchmark]: Witness Printer took 35.81ms. Allocated memory is still 90.2MB. Free memory was 39.8MB in the beginning and 36.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:47:06,577 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 60.8MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.94ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 42.2MB in the end (delta: -2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.62ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3032.90ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 37.1MB in the beginning and 65.3MB in the end (delta: -28.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31512.53ms. Allocated memory is still 90.2MB. Free memory was 64.6MB in the beginning and 39.8MB in the end (delta: 24.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 35.81ms. Allocated memory is still 90.2MB. Free memory was 39.8MB in the beginning and 36.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,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: 137]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 1675 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 203 IncrementalHoareTripleChecker+Unchecked, 1243 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 432 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 63, 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, 9 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 164 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 165 ConstructedInterpolants, 32 QuantifiedInterpolants, 1196 SizeOfPredicates, 56 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1/1 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: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant [2022-02-20 16:47:06,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] Derived loop invariant: (x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && (\exists v_ULTIMATE.start_fmod_float_~hx~0#1_39 : bv32, v_ULTIMATE.start_fmod_float_~hy~0#1_24 : bv32 :: (!~bvslt32(~bvxor32(~bvand32(v_ULTIMATE.start_fmod_float_~hx~0#1_39, 2147483648bv32), v_ULTIMATE.start_fmod_float_~hx~0#1_39), ~bvand32(2147483647bv32, v_ULTIMATE.start_fmod_float_~hy~0#1_24)) && i == ~bvshl32(~bvand32(2147483647bv32, v_ULTIMATE.start_fmod_float_~hy~0#1_24), 8bv32)) && ~fp~LONGDOUBLE(v_ULTIMATE.start_fmod_float_~hx~0#1_39[31:31], v_ULTIMATE.start_fmod_float_~hx~0#1_39[30:23], v_ULTIMATE.start_fmod_float_~hx~0#1_39[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()))) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && (~fp.lt~FLOAT(y, ~Pluszero~LONGDOUBLE()) || ~fp.gt~FLOAT(y, ~Pluszero~LONGDOUBLE()))) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant [2022-02-20 16:47:06,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] [2022-02-20 16:47:06,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_22,QUANTIFIED] [2022-02-20 16:47:06,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] [2022-02-20 16:47:06,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_39,QUANTIFIED] Derived loop invariant: ((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && (\exists v_ULTIMATE.start_fmod_float_~hy~0#1_22 : bv32 :: ~bvand32(2147483647bv32, v_ULTIMATE.start_fmod_float_~hy~0#1_22) == hy)) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && (\exists v_ULTIMATE.start_fmod_float_~hx~0#1_39 : bv32 :: ~fp~LONGDOUBLE(v_ULTIMATE.start_fmod_float_~hx~0#1_39[31:31], v_ULTIMATE.start_fmod_float_~hx~0#1_39[30:23], v_ULTIMATE.start_fmod_float_~hx~0#1_39[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && !~bvslt32(~bvxor32(~bvand32(v_ULTIMATE.start_fmod_float_~hx~0#1_39, 2147483648bv32), v_ULTIMATE.start_fmod_float_~hx~0#1_39), hy)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == \result) && \result == 1bv32) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == \result) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == \result) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x RESULT: Ultimate proved your program to be correct! [2022-02-20 16:47:06,703 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