./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1130a.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_1130a.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 2b4beb2d56fd26727d06ab5e32646878129bf03feaf41ed8f7c7126586310d6a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:25,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:25,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:25,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:25,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:25,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:25,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:25,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:25,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:25,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:25,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:25,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:25,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:25,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:25,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:25,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:25,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:25,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:25,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:25,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:25,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:25,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:25,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:25,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:25,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:25,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:25,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:25,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:25,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:25,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:25,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:25,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:25,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:25,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:25,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:25,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:25,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:25,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:25,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:25,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:25,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:25,531 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,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:25,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:25,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:25,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:25,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:25,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:25,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:25,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:25,562 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:25,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:25,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:25,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:25,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:25,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:25,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:25,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:25,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:25,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:25,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:25,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:25,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:25,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:25,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:25,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:25,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:25,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:25,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:25,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:25,567 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 -> 2b4beb2d56fd26727d06ab5e32646878129bf03feaf41ed8f7c7126586310d6a [2022-02-20 16:46:25,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:25,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:25,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:25,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:25,810 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:25,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-02-20 16:46:25,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed06d915/3c8af59e827849879c5743736792a5da/FLAG11cff8c24 [2022-02-20 16:46:26,212 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:26,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-02-20 16:46:26,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed06d915/3c8af59e827849879c5743736792a5da/FLAG11cff8c24 [2022-02-20 16:46:26,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed06d915/3c8af59e827849879c5743736792a5da [2022-02-20 16:46:26,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:26,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:26,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:26,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:26,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:26,648 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,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3877ef6 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,649 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,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:26,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:26,872 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_1130a.c[2907,2920] [2022-02-20 16:46:26,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:26,888 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:26,916 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_1130a.c[2907,2920] [2022-02-20 16:46:26,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:26,930 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:26,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26 WrapperNode [2022-02-20 16:46:26,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:26,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:26,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:26,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:26,937 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:26" (1/1) ... [2022-02-20 16:46:26,944 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:26" (1/1) ... [2022-02-20 16:46:27,006 INFO L137 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 223 [2022-02-20 16:46:27,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:27,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:27,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:27,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:27,015 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:26" (1/1) ... [2022-02-20 16:46:27,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:27,028 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:26" (1/1) ... [2022-02-20 16:46:27,030 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:26" (1/1) ... [2022-02-20 16:46:27,042 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:26" (1/1) ... [2022-02-20 16:46:27,058 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:26" (1/1) ... [2022-02-20 16:46:27,061 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:26" (1/1) ... [2022-02-20 16:46:27,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:27,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:27,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:27,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:27,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:27,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:27,100 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,106 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,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:27,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:27,206 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:27,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:27,640 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:27,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:27,646 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:27,647 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,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:27,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:27,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:27,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:27,653 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,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155bdecf 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,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26" (2/3) ... [2022-02-20 16:46:27,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155bdecf 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,654 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,655 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1130a.c [2022-02-20 16:46:27,659 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:27,659 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:27,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:27,697 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,697 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:27,711 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,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:27,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:27,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:27,716 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -682512150, now seen corresponding path program 1 times [2022-02-20 16:46:27,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:27,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242004899] [2022-02-20 16:46:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:27,864 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:27,866 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 := 0.0;main_~y~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {63#true} is VALID [2022-02-20 16:46:27,866 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:27,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#true} assume !true; {64#false} is VALID [2022-02-20 16:46:27,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#false} assume !true; {64#false} is VALID [2022-02-20 16:46:27,868 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:27,868 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:27,869 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:27,869 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, 0.0); {64#false} is VALID [2022-02-20 16:46:27,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {64#false} assume !main_#t~short19#1; {64#false} is VALID [2022-02-20 16:46:27,870 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:27,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-02-20 16:46:27,872 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:27,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:27,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242004899] [2022-02-20 16:46:27,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242004899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:27,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:27,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:27,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111800463] [2022-02-20 16:46:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:27,879 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:27,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:27,882 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:27,895 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:27,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:27,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:27,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:27,918 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,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,032 INFO L93 Difference]: Finished difference Result 117 states and 204 transitions. [2022-02-20 16:46:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:28,034 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,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:28,035 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,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 16:46:28,047 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,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2022-02-20 16:46:28,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 204 transitions. [2022-02-20 16:46:28,230 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,241 INFO L225 Difference]: With dead ends: 117 [2022-02-20 16:46:28,241 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 16:46:28,244 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,250 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,251 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,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 16:46:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 16:46:28,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:28,277 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,278 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,278 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,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,287 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-02-20 16:46:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,289 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,291 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,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,297 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-02-20 16:46:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:28,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:28,299 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,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-02-20 16:46:28,308 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 12 [2022-02-20 16:46:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:28,308 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-02-20 16:46:28,308 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,309 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-20 16:46:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:28,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:28,309 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,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:28,310 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 337837613, now seen corresponding path program 1 times [2022-02-20 16:46:28,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:28,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105640970] [2022-02-20 16:46:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:28,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:28,447 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:28,448 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:28,449 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:28,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:28,455 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:28,457 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:28,477 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:28,478 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,479 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,480 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,481 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:46:28,482 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:28,483 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,484 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,484 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,484 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,484 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,484 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,485 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,486 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,487 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,488 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,489 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,490 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,490 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,490 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,490 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,490 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,491 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,492 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:28,493 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,495 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,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:28,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:28,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:28,499 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:28,500 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,502 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:28,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:28,504 INFO L158 Benchmark]: Toolchain (without parser) took 1863.29ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 43.0MB in the end (delta: 29.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,505 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:28,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.43ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 80.4MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.07ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 77.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,511 INFO L158 Benchmark]: Boogie Preprocessor took 63.15ms. Allocated memory is still 107.0MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,517 INFO L158 Benchmark]: RCFGBuilder took 575.98ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 51.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,518 INFO L158 Benchmark]: TraceAbstraction took 846.96ms. Allocated memory is still 107.0MB. Free memory was 50.5MB in the beginning and 43.6MB in the end (delta: 6.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,519 INFO L158 Benchmark]: Witness Printer took 6.54ms. Allocated memory is still 107.0MB. Free memory was 43.6MB in the beginning and 43.0MB in the end (delta: 599.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:28,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.43ms. Allocated memory is still 107.0MB. Free memory was 72.8MB in the beginning and 80.4MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.07ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 77.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.15ms. Allocated memory is still 107.0MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.98ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 51.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 846.96ms. Allocated memory is still 107.0MB. Free memory was 50.5MB in the beginning and 43.6MB in the end (delta: 6.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 6.54ms. Allocated memory is still 107.0MB. Free memory was 43.6MB in the beginning and 43.0MB in the end (delta: 599.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 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)=0, \old(y)=4294967297, one_fmod=1, x=0, 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)=0, \old(y)=4294967297, hx=0, hy=-1, one_fmod=1, sx=0, x=0, y=4294967297, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=0, \old(y)=4294967297, hx=0, hy=2139095041, one_fmod=1, sx=0, x=0, y=4294967297, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=0, \old(y)=4294967297, hx=0, hy=2139095041, one_fmod=1, sx=0, x=0, 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) == 0 VAL [one_fmod=1, res=4294967298, res == 0.0f && __signbit_float(res) == 0=0, x=0, y=4294967297, Zero_fmod={4:0}] [L136] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L137] reach_error() VAL [one_fmod=1, res=4294967298, x=0, 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.4s, 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,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1130a.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 2b4beb2d56fd26727d06ab5e32646878129bf03feaf41ed8f7c7126586310d6a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:30,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:30,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:30,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:30,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:30,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:30,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:30,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:30,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:30,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:30,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:30,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:30,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:30,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:30,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:30,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:30,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:30,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:30,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:30,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:30,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:30,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:30,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:30,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:30,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:30,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:30,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:30,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:30,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:30,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:30,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:30,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:30,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:30,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:30,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:30,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:30,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:30,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:30,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:30,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:30,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:30,577 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,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:30,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:30,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:30,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:30,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:30,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:30,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:30,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:30,612 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:30,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:30,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:30,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:30,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:30,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:30,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:30,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:30,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:30,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:30,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:30,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:30,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:30,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:30,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:30,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:30,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:30,617 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:30,617 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:30,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:30,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:30,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:30,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:30,618 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 -> 2b4beb2d56fd26727d06ab5e32646878129bf03feaf41ed8f7c7126586310d6a [2022-02-20 16:46:30,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:30,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:30,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:30,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:30,925 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:30,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-02-20 16:46:30,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6411f30/cec33ca72d904a0da3c8fbcbe09beffa/FLAGc16fee0ce [2022-02-20 16:46:31,364 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:31,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-02-20 16:46:31,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6411f30/cec33ca72d904a0da3c8fbcbe09beffa/FLAGc16fee0ce [2022-02-20 16:46:31,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6411f30/cec33ca72d904a0da3c8fbcbe09beffa [2022-02-20 16:46:31,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:31,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:31,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:31,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:31,388 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,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa4bc90 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,389 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,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:31,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:31,602 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_1130a.c[2907,2920] [2022-02-20 16:46:31,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,624 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:31,668 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_1130a.c[2907,2920] [2022-02-20 16:46:31,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,692 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:31,693 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,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:31,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:31,700 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,722 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,762 INFO L137 Inliner]: procedures = 21, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 187 [2022-02-20 16:46:31,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:31,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:31,771 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,772 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,789 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,790 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,800 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,813 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,821 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,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:31,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:31,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:31,834 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,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:31,865 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:31,880 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:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:32,017 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:32,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:34,838 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:34,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:34,845 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:34,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34 BoogieIcfgContainer [2022-02-20 16:46:34,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:34,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:34,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:34,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:34,851 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:34,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4b5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,851 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:34,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4b5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34" (3/3) ... [2022-02-20 16:46:34,853 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1130a.c [2022-02-20 16:46:34,857 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:34,857 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:34,893 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:34,898 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:34,899 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:34,911 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:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:34,914 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:34,915 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 461941989, now seen corresponding path program 1 times [2022-02-20 16:46:34,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:34,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114664269] [2022-02-20 16:46:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:34,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:34,943 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:34,990 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,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:35,288 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,289 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 := ~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,289 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,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#true} assume !true; {51#true} is VALID [2022-02-20 16:46:35,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-02-20 16:46:35,290 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,291 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,291 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, ~Pluszero~FLOAT()); {52#false} is VALID [2022-02-20 16:46:35,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#false} assume !main_#t~short16#1; {52#false} is VALID [2022-02-20 16:46:35,291 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,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-02-20 16:46:35,292 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,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:35,293 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:35,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114664269] [2022-02-20 16:46:35,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114664269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:35,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:35,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:35,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476300081] [2022-02-20 16:46:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:35,300 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,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:35,303 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,605 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,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:35,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:35,634 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:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:37,832 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2022-02-20 16:46:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:37,833 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:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:37,834 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:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:46:37,842 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:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:46:37,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 156 transitions. [2022-02-20 16:46:38,474 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,483 INFO L225 Difference]: With dead ends: 93 [2022-02-20 16:46:38,483 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:38,485 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,488 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,488 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,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:38,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:38,512 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,512 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,513 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,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,516 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-02-20 16:46:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,518 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,518 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,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,521 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-02-20 16:46:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:38,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:38,522 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 16:46:38,525 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 11 [2022-02-20 16:46:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:38,526 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 16:46:38,526 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,526 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 16:46:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:38,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:38,551 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:38,743 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:38,744 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1049045826, now seen corresponding path program 1 times [2022-02-20 16:46:38,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:38,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717276248] [2022-02-20 16:46:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:38,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:38,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:38,747 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:38,749 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:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 16:46:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,202 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,417 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 29 treesize of output 13 [2022-02-20 16:46:39,770 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:39,771 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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {350#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:39,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#(= (_ +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| (_ +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:39,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {354#(and (= |ULTIMATE.start_fmod_float_~x#1| (_ +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)))) (_ +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:39,778 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)))) (_ +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)))) (_ +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:39,783 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)))) (_ +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 (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))) (= (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|)) (_ +zero 8 24)))} is VALID [2022-02-20 16:46:39,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(and (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))) (= (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|)) (_ +zero 8 24)))} goto; {365#(and (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))) (= (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|)) (_ +zero 8 24)))} is VALID [2022-02-20 16:46:39,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(and (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))) (= (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|)) (_ +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 (= (_ +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|))) (= (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|))) (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,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#(and (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32))) (and (= (_ +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|))) (= (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|))) (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,038 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, ~Pluszero~FLOAT()); {343#false} is VALID [2022-02-20 16:46:40,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#false} assume !main_#t~short16#1; {343#false} is VALID [2022-02-20 16:46:40,038 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,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 16:46:40,039 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,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:40,039 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:40,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717276248] [2022-02-20 16:46:40,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717276248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:40,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:40,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:40,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685539119] [2022-02-20 16:46:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:40,041 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,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:40,041 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,282 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,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:40,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:40,284 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,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,049 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 16:46:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:42,049 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,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,049 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,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:46:42,051 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,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:46:42,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-20 16:46:42,365 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,366 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:46:42,366 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:46:42,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:42,368 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 28 Unchecked, 0.3s Time] [2022-02-20 16:46:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:46:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:46:42,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,372 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:42,373 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:42,373 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:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,376 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:46:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:42,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,377 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:42,377 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:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,379 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:46:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:42,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,380 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:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-20 16:46:42,381 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 13 [2022-02-20 16:46:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,382 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-20 16:46:42,382 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:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:46:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:42,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,400 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:42,599 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:42,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1911951893, now seen corresponding path program 1 times [2022-02-20 16:46:42,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:42,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585415555] [2022-02-20 16:46:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:42,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:42,604 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:42,606 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:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:46:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:42,843 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:42,847 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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {607#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#(= (_ +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| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#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; {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} goto; {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#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; {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} goto; {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#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); {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +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| (_ +zero 8 24))} is VALID [2022-02-20 16:46:42,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {633#(= (_ +zero 8 24) |ULTIMATE.start_fmod_float_#res#1|)} is VALID [2022-02-20 16:46:42,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(= (_ +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, ~Pluszero~FLOAT()); {637#|ULTIMATE.start_main_#t~short16#1|} is VALID [2022-02-20 16:46:42,862 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:42,862 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:42,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 16:46:42,862 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:42,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:42,862 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:42,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585415555] [2022-02-20 16:46:42,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585415555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:42,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:42,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:42,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754908672] [2022-02-20 16:46:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:42,864 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:42,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:42,864 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:42,880 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:42,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:42,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:42,881 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:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,249 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 16:46:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:44,249 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:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:44,249 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:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-20 16:46:44,251 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:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-02-20 16:46:44,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-02-20 16:46:44,364 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:44,366 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:46:44,366 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:46:44,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:44,367 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:44,368 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.4s Time] [2022-02-20 16:46:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:46:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2022-02-20 16:46:44,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:44,373 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:44,373 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:44,373 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:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,375 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-02-20 16:46:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-20 16:46:44,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:44,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:44,376 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:44,376 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:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,378 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-02-20 16:46:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-20 16:46:44,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:44,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:44,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:44,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:44,380 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:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-02-20 16:46:44,381 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 14 [2022-02-20 16:46:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:44,381 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-02-20 16:46:44,381 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:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-02-20 16:46:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:44,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:44,382 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:44,394 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:44,594 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:44,595 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 791016935, now seen corresponding path program 1 times [2022-02-20 16:46:44,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:44,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324738350] [2022-02-20 16:46:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:44,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:44,597 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:44,611 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:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:44,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:44,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:45,092 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:45,093 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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {926#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:45,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {926#(= (_ +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| (_ +zero 8 24))} is VALID [2022-02-20 16:46:45,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#(= |ULTIMATE.start_fmod_float_~x#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; {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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:45,096 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|)) (_ +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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:45,097 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|)) (_ +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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:45,097 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|)) (_ +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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:45,099 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|)) (_ +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|) (= (_ +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:45,101 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|) (= (_ +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|) (= (_ +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:45,102 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|) (= (_ +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|) (= (_ +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:45,104 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|) (= (_ +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:45,104 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, ~Pluszero~FLOAT()); {919#false} is VALID [2022-02-20 16:46:45,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {919#false} assume !main_#t~short16#1; {919#false} is VALID [2022-02-20 16:46:45,108 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:45,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#false} assume !false; {919#false} is VALID [2022-02-20 16:46:45,108 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:45,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:45,109 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:45,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324738350] [2022-02-20 16:46:45,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324738350] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:45,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:45,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:45,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709215407] [2022-02-20 16:46:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:45,110 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:45,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:45,111 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:45,132 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:45,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:45,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:45,134 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:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,019 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-02-20 16:46:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:47,020 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:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:47,020 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:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 16:46:47,022 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:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 16:46:47,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-02-20 16:46:47,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,127 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:46:47,127 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:46:47,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:47,129 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:47,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 222 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-02-20 16:46:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:46:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2022-02-20 16:46:47,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:47,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 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:47,134 INFO L74 IsIncluded]: Start isIncluded. First operand 55 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:47,134 INFO L87 Difference]: Start difference. First operand 55 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:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,136 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-02-20 16:46:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-02-20 16:46:47,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,137 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 55 states. [2022-02-20 16:46:47,137 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 55 states. [2022-02-20 16:46:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,139 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-02-20 16:46:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-02-20 16:46:47,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:47,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:47,140 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:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 16:46:47,141 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 15 [2022-02-20 16:46:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:47,141 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 16:46:47,142 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:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 16:46:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:47,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:47,143 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:47,157 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:47,353 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:47,353 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -645654976, now seen corresponding path program 1 times [2022-02-20 16:46:47,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:47,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238650355] [2022-02-20 16:46:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:47,356 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:47,359 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:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:47,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {1223#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); {1223#true} is VALID [2022-02-20 16:46:47,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {1223#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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1231#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:47,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#(= (_ +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; {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#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; {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} goto; {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#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; {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} goto; {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#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); {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {1235#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {1257#(= (_ +zero 8 24) |ULTIMATE.start_fmod_float_#res#1|)} is VALID [2022-02-20 16:46:47,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#(= (_ +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, ~Pluszero~FLOAT()); {1261#(= |ULTIMATE.start_main_~res~0#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(= |ULTIMATE.start_main_~res~0#1| (_ +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; {1265#(= |ULTIMATE.start___signbit_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(= |ULTIMATE.start___signbit_float_~x#1| (_ +zero 8 24))} 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; {1269#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#(= (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|)) (_ +zero 8 24))} goto; {1269#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:47,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#(= (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|)) (_ +zero 8 24))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {1276#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32))} is VALID [2022-02-20 16:46:47,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {1276#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32))} main_#t~ret15#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short16#1 := 0bv32 == main_#t~ret15#1; {1280#|ULTIMATE.start_main_#t~short16#1|} is VALID [2022-02-20 16:46:47,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#|ULTIMATE.start_main_#t~short16#1|} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1224#false} is VALID [2022-02-20 16:46:47,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {1224#false} assume !false; {1224#false} is VALID [2022-02-20 16:46:47,830 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:47,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:47,831 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:47,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238650355] [2022-02-20 16:46:47,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238650355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:47,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:47,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:47,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730760661] [2022-02-20 16:46:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:47,832 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:47,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:47,832 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:47,849 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:47,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:47,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:47,850 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:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,785 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 16:46:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:46:50,786 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:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:50,786 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:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 16:46:50,787 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:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 16:46:50,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2022-02-20 16:46:50,893 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:50,895 INFO L225 Difference]: With dead ends: 62 [2022-02-20 16:46:50,895 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:46:50,895 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:50,896 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 141 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:50,896 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.3s Time] [2022-02-20 16:46:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:46:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-02-20 16:46:50,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:50,900 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:50,901 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:50,901 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:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,902 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 16:46:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 16:46:50,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:50,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:50,903 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:50,904 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:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,905 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 16:46:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 16:46:50,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:50,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:50,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:50,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:50,906 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:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2022-02-20 16:46:50,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 18 [2022-02-20 16:46:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:50,914 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2022-02-20 16:46:50,914 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:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 16:46:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:50,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:50,915 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:50,925 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:51,123 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:51,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1896589553, now seen corresponding path program 1 times [2022-02-20 16:46:51,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:51,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213460678] [2022-02-20 16:46:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:51,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:51,126 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:51,131 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:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:51,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {1540#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); {1540#true} is VALID [2022-02-20 16:46:51,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1548#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:51,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#(= (_ +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; {1552#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {1552#(= |ULTIMATE.start_fmod_float_~x#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; {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} goto; {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#(= (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|)) (_ +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; {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} goto; {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(= (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|)) (_ +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); {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {1556#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:51,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1556#(= (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|)) (_ +zero 8 24))} assume !~bvslt32(fmod_float_~hx~0#1, 8388608bv32);fmod_float_~ix~0#1 := ~bvsub32(~bvashr32(fmod_float_~hx~0#1, 23bv32), 127bv32); {1541#false} is VALID [2022-02-20 16:46:51,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1541#false} assume !~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := ~bvsub32(~bvashr32(fmod_float_~hy~0#1, 23bv32), 127bv32); {1541#false} is VALID [2022-02-20 16:46:51,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {1541#false} is VALID [2022-02-20 16:46:51,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {1541#false} is VALID [2022-02-20 16:46:51,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#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); {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {1541#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, ~Pluszero~FLOAT()); {1541#false} is VALID [2022-02-20 16:46:51,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {1541#false} assume !main_#t~short16#1; {1541#false} is VALID [2022-02-20 16:46:51,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {1541#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1541#false} is VALID [2022-02-20 16:46:51,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-02-20 16:46:51,452 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:51,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:51,452 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:51,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213460678] [2022-02-20 16:46:51,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213460678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:51,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:51,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:51,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246946206] [2022-02-20 16:46:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:51,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:51,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:51,475 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:51,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:51,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:51,477 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,557 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-02-20 16:46:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 16:46:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 16:46:52,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2022-02-20 16:46:52,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:52,721 INFO L225 Difference]: With dead ends: 101 [2022-02-20 16:46:52,721 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 16:46:52,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:52,722 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 132 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:52,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 103 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:46:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 16:46:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-02-20 16:46:52,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:52,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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,736 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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,736 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,738 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-02-20 16:46:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-02-20 16:46:52,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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 71 states. [2022-02-20 16:46:52,741 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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 71 states. [2022-02-20 16:46:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,751 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-02-20 16:46:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-02-20 16:46:52,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:52,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 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,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2022-02-20 16:46:52,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 24 [2022-02-20 16:46:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:52,756 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2022-02-20 16:46:52,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-02-20 16:46:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:52,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:52,758 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:52,770 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:52,968 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:52,968 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1844332961, now seen corresponding path program 1 times [2022-02-20 16:46:52,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:52,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971973613] [2022-02-20 16:46:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:52,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:52,970 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:52,971 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:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:53,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:53,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:53,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1951#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); {1951#true} is VALID [2022-02-20 16:46:53,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1959#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:53,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1959#(= (_ +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; {1963#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:53,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {1963#(= |ULTIMATE.start_fmod_float_~x#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; {1967#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:53,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {1967#(= (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|)) (_ +zero 8 24))} goto; {1967#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:53,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {1967#(= (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|)) (_ +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; {1967#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:53,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {1967#(= (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|)) (_ +zero 8 24))} goto; {1967#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:53,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1967#(= (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|)) (_ +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); {1980#(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 (= (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|) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1980#(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 (= (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|) (= (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|)) (_ +zero 8 24)))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {1980#(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 (= (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|) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {1980#(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 (= (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|) (= (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|)) (_ +zero 8 24)))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} assume !(fmod_float_~hx~0#1 == fmod_float_~hy~0#1); {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} 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); {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} assume !~bvsgt32(fmod_float_~i~0#1, 0bv32); {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1987#(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 (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|)) (= (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|)) (_ +zero 8 24)))))} assume !~bvslt32(fmod_float_~hy~0#1, 8388608bv32);fmod_float_~iy~0#1 := ~bvsub32(~bvashr32(fmod_float_~hy~0#1, 23bv32), 127bv32); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1952#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1952#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1952#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); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {1952#false} is VALID [2022-02-20 16:46:53,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {1952#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; {1952#false} is VALID [2022-02-20 16:46:53,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1952#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, ~Pluszero~FLOAT()); {1952#false} is VALID [2022-02-20 16:46:53,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {1952#false} assume !main_#t~short16#1; {1952#false} is VALID [2022-02-20 16:46:53,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {1952#false} is VALID [2022-02-20 16:46:53,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1952#false} assume !false; {1952#false} is VALID [2022-02-20 16:46:53,579 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,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:53,580 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:53,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971973613] [2022-02-20 16:46:53,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971973613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:53,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:53,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:53,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532448206] [2022-02-20 16:46:53,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:53,581 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:53,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:53,581 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:53,619 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:53,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:53,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:53,620 INFO L87 Difference]: Start difference. First operand 52 states and 68 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:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,667 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2022-02-20 16:46:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:55,667 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:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,667 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:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 16:46:55,668 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:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-02-20 16:46:55,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-02-20 16:46:55,803 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:55,804 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:46:55,804 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 16:46:55,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:55,805 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 228 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-02-20 16:46:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 16:46:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 16:46:55,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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,810 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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,810 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,811 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 16:46:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 16:46:55,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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 52 states. [2022-02-20 16:46:55,812 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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 52 states. [2022-02-20 16:46:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,814 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 16:46:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 16:46:55,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 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,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-02-20 16:46:55,816 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2022-02-20 16:46:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,816 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-02-20 16:46:55,816 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:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 16:46:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:46:55,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,817 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:55,829 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:56,029 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:56,030 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 101160342, now seen corresponding path program 1 times [2022-02-20 16:46:56,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:56,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518969752] [2022-02-20 16:46:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:56,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:56,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:56,032 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:56,033 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:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:46:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:56,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {2311#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); {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#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; {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {2311#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; {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {2311#true} goto; {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {2311#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; {2311#true} is VALID [2022-02-20 16:46:56,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {2311#true} goto; {2311#true} is VALID [2022-02-20 16:46:56,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#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); {2337#(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:56,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2337#(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)); {2337#(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:56,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2337#(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); {2337#(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:56,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2337#(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); {2337#(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:56,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2337#(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); {2337#(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:56,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2337#(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); {2337#(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:56,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2337#(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); {2356#(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:56,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {2356#(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); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {2312#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {2312#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {2312#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#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); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {2312#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {2312#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; {2312#false} is VALID [2022-02-20 16:46:56,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {2312#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, ~Pluszero~FLOAT()); {2312#false} is VALID [2022-02-20 16:46:56,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {2312#false} assume !main_#t~short16#1; {2312#false} is VALID [2022-02-20 16:46:56,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {2312#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {2312#false} is VALID [2022-02-20 16:46:56,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2022-02-20 16:46:56,373 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,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:56,373 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:56,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518969752] [2022-02-20 16:46:56,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518969752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:56,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:56,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:56,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506378100] [2022-02-20 16:46:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:56,374 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:56,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:56,374 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:56,412 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:56,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:56,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:56,413 INFO L87 Difference]: Start difference. First operand 52 states and 67 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:46:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,493 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2022-02-20 16:46:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:59,493 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,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:59,494 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:46:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 16:46:59,495 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:46:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-02-20 16:46:59,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-02-20 16:46:59,628 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:46:59,629 INFO L225 Difference]: With dead ends: 88 [2022-02-20 16:46:59,629 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:46:59,629 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:46:59,630 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:46:59,630 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:46:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:46:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 16:46:59,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:59,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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,635 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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,635 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,636 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 16:46:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:46:59,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:59,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:59,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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:59,637 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,638 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 16:46:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:46:59,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:59,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:59,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:59,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 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,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-02-20 16:46:59,641 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 26 [2022-02-20 16:46:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:59,641 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-02-20 16:46:59,641 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:46:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:46:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:46:59,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:59,642 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:46:59,657 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:46:59,853 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:46:59,853 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 305949144, now seen corresponding path program 1 times [2022-02-20 16:46:59,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:59,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544369023] [2022-02-20 16:46:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:59,855 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:46:59,856 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:46:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:00,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {2671#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); {2671#true} is VALID [2022-02-20 16:47:00,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2671#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 := ~Pluszero~FLOAT();main_~y~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2679#(= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:47:00,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(= (_ +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; {2683#(= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:47:00,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {2683#(= |ULTIMATE.start_fmod_float_~x#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; {2687#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:47:00,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {2687#(= (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|)) (_ +zero 8 24))} goto; {2687#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:47:00,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {2687#(= (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|)) (_ +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; {2687#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:47:00,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {2687#(= (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|)) (_ +zero 8 24))} goto; {2687#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:47:00,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {2687#(= (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|)) (_ +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); {2700#(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|)) (_ +zero 8 24)) (= (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|))))} is VALID [2022-02-20 16:47:00,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {2700#(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|)) (_ +zero 8 24)) (= (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|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {2700#(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|)) (_ +zero 8 24)) (= (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|))))} is VALID [2022-02-20 16:47:00,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2700#(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|)) (_ +zero 8 24)) (= (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|))))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {2707#(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|)) (_ +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:00,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2707#(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|)) (_ +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); {2707#(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|)) (_ +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:00,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2707#(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|)) (_ +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); {2707#(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|)) (_ +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:00,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {2707#(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|)) (_ +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); {2707#(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|)) (_ +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:00,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {2707#(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|)) (_ +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); {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} is VALID [2022-02-20 16:47:00,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} assume !!~bvsge32(fmod_float_~i~0#1, 0bv32);fmod_float_~iy~0#1 := ~bvsub32(fmod_float_~iy~0#1, 1bv32); {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} is VALID [2022-02-20 16:47:00,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} fmod_float_~i~0#1 := ~bvshl32(fmod_float_~i~0#1, 1bv32); {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ 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|)) (_ +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|) (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)))))} assume !~bvsge32(fmod_float_~i~0#1, 0bv32); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#false} assume ~bvsge32(fmod_float_~ix~0#1, 4294967170bv32);fmod_float_~hx~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hx~0#1)); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {2672#false} assume ~bvsge32(fmod_float_~iy~0#1, 4294967170bv32);fmod_float_~hy~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, fmod_float_~hy~0#1)); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {2672#false} fmod_float_~n~0#1 := ~bvsub32(fmod_float_~ix~0#1, fmod_float_~iy~0#1); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {2672#false} fmod_float_#t~post7#1 := fmod_float_~n~0#1;fmod_float_~n~0#1 := ~bvsub32(fmod_float_#t~post7#1, 1bv32); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#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); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#false} assume !~bvslt32(fmod_float_~hz~0#1, 0bv32); {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#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; {2672#false} is VALID [2022-02-20 16:47:00,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {2672#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, ~Pluszero~FLOAT()); {2672#false} is VALID [2022-02-20 16:47:00,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {2672#false} assume !main_#t~short16#1; {2672#false} is VALID [2022-02-20 16:47:00,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {2672#false} assume !main_#t~short16#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {2672#false} is VALID [2022-02-20 16:47:00,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {2672#false} assume !false; {2672#false} is VALID [2022-02-20 16:47:00,775 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:00,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:00,775 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:00,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544369023] [2022-02-20 16:47:00,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544369023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:00,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:00,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:47:00,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610036856] [2022-02-20 16:47:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:00,777 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:00,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:00,777 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:00,824 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:00,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:47:00,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:47:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:47:00,826 INFO L87 Difference]: Start difference. First operand 53 states and 68 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:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,167 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 16:47:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:47:01,168 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:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:01,168 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:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-02-20 16:47:01,169 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:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-02-20 16:47:01,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-02-20 16:47:01,274 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:01,274 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:47:01,274 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:47:01,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:47:01,276 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:47:01,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-02-20 16:47:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:47:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:47:01,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:01,277 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:01,277 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:01,277 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:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,277 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:01,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,278 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:01,278 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:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:01,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:47:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:01,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:01,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:01,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:01,279 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:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:47:01,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-02-20 16:47:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:01,280 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:47:01,280 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:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:47:01,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:01,283 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:47:01,293 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:01,493 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:01,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:47:02,007 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:47:02,007 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:47:02,007 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,007 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:47:02,007 INFO L854 garLoopResultBuilder]: At program point L118(lines 109 119) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_~x#1| (_ +zero 8 24)) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (_ +zero 8 24) |ULTIMATE.start_fmod_float_#res#1|) (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (= |ULTIMATE.start_main_~res~0#1| (_ +zero 8 24)) |ULTIMATE.start_main_#t~short16#1| (= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|) (= (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|)) (_ +zero 8 24))) [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-02-20 16:47:02,008 INFO L858 garLoopResultBuilder]: For program point L136-2(lines 136 139) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L854 garLoopResultBuilder]: At program point L112-2(lines 112 116) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start_fmod_float_#res#1|) (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (= |ULTIMATE.start_main_~res~0#1| (_ +zero 8 24)) |ULTIMATE.start_main_#t~short16#1| (= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)) [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L112-3(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:47:02,009 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:47:02,010 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:47:02,010 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start_main_~x~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)))) [2022-02-20 16:47:02,010 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:47:02,010 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,010 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_fmod_float_#res#1|) (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|)) [2022-02-20 16:47:02,010 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:47:02,010 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L858 garLoopResultBuilder]: For program point L131-2(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:47:02,011 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:47:02,011 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_39| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~hy~0#1_24| (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_24|))) (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|)) (_ +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|) .cse0)) (= |ULTIMATE.start_fmod_float_~i~0#1| (bvshl .cse0 (_ bv8 32)))))) (= (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|)) (_ +zero 8 24))) [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:47:02,012 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,012 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:47:02,013 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:47:02,013 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:47:02,013 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:47:02,013 INFO L861 garLoopResultBuilder]: At program point L142(lines 121 143) the Hoare annotation is: true [2022-02-20 16:47:02,013 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:47:02,013 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (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|)) (= (_ +zero 8 24) |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_38| (_ BitVec 32))) (and (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|)) (= (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|)) (_ +zero 8 24)))) (= (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|)) (_ +zero 8 24))) [2022-02-20 16:47:02,015 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:02,017 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:47:02,019 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:47:02,019 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:47:02,019 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:47:02,019 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:02,020 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:02,021 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:02,022 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:02,023 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:02,024 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:02,025 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:02,026 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:02,027 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:02,028 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:02,028 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:02,028 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:02,028 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:02,028 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:02,033 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:02,033 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:02,034 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:02,034 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:02,034 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:02,034 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:02,034 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:02,036 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:02,036 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:02,037 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:02,037 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:02,037 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:02,037 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:02,037 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:02,038 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:02,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,040 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:02,040 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,040 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,040 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,040 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,041 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:02 BoogieIcfgContainer [2022-02-20 16:47:02,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:02,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:02,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:02,043 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:02,044 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:34" (3/4) ... [2022-02-20 16:47:02,046 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:47:02,054 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 16:47:02,054 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:47:02,054 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:47:02,055 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:47:02,078 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:47:02,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:02,079 INFO L158 Benchmark]: Toolchain (without parser) took 30695.77ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.8MB in the beginning and 27.9MB in the end (delta: 2.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,079 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:02,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.11ms. Allocated memory is still 54.5MB. Free memory was 30.6MB in the beginning and 32.7MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.89ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,080 INFO L158 Benchmark]: Boogie Preprocessor took 68.65ms. Allocated memory is still 54.5MB. Free memory was 30.1MB in the beginning and 27.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,080 INFO L158 Benchmark]: RCFGBuilder took 3013.50ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 27.8MB in the beginning and 37.0MB in the end (delta: -9.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,081 INFO L158 Benchmark]: TraceAbstraction took 27194.70ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 30.6MB in the end (delta: 6.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,081 INFO L158 Benchmark]: Witness Printer took 35.38ms. Allocated memory is still 67.1MB. Free memory was 30.6MB in the beginning and 27.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:02,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.11ms. Allocated memory is still 54.5MB. Free memory was 30.6MB in the beginning and 32.7MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.89ms. Allocated memory is still 54.5MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.65ms. Allocated memory is still 54.5MB. Free memory was 30.1MB in the beginning and 27.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3013.50ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 27.8MB in the beginning and 37.0MB in the end (delta: -9.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27194.70ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 30.6MB in the end (delta: 6.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 35.38ms. Allocated memory is still 67.1MB. Free memory was 30.6MB in the beginning and 27.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[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_~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_~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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,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_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,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: 27.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 1533 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 110 IncrementalHoareTripleChecker+Unchecked, 1075 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 458 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, InterpolantAutomatonStates: 62, 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, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 160 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 210 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 165 ConstructedInterpolants, 28 QuantifiedInterpolants, 1085 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:02,092 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:02,092 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:02,092 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:02,092 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:02,092 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:02,092 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:02,092 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:02,093 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:02,093 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:02,093 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:02,093 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:02,093 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:02,094 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:02,094 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hy~0#1_24,QUANTIFIED] Derived loop invariant: ((x == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (\exists v_ULTIMATE.start_fmod_float_~hx~0#1_39 : bv32, v_ULTIMATE.start_fmod_float_~hy~0#1_24 : 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]) == ~Pluszero~LONGDOUBLE() && !~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(hx[31:31], hx[30:23], hx[22:0]) == ~Pluszero~LONGDOUBLE() - 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 == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (~fp.lt~FLOAT(y, ~Pluszero~LONGDOUBLE()) || ~fp.gt~FLOAT(y, ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant [2022-02-20 16:47:02,095 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:02,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,096 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:02,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,097 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,097 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] [2022-02-20 16:47:02,097 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmod_float_~hx~0#1_38,QUANTIFIED] Derived loop invariant: (((x == ~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)) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_ULTIMATE.start_fmod_float_~hx~0#1_38 : bv32 :: !~bvslt32(~bvxor32(~bvand32(v_ULTIMATE.start_fmod_float_~hx~0#1_38, 2147483648bv32), v_ULTIMATE.start_fmod_float_~hx~0#1_38), hy) && ~fp~LONGDOUBLE(v_ULTIMATE.start_fmod_float_~hx~0#1_38[31:31], v_ULTIMATE.start_fmod_float_~hx~0#1_38[30:23], v_ULTIMATE.start_fmod_float_~hx~0#1_38[22:0]) == ~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(hx[31:31], hx[30:23], hx[22:0]) == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((x == ~Pluszero~LONGDOUBLE() && \result == 0bv32) && ~Pluszero~LONGDOUBLE() == \result) && x == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == x) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((x == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == \result) && x == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == \result && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x RESULT: Ultimate proved your program to be correct! [2022-02-20 16:47:02,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE