./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1211a.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_1211a.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 11de8b1d34bf28c678335a47cf13777a2fdebca168e06294b055c2a549d4333e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:31,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:31,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:32,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:32,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:32,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:32,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:32,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:32,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:32,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:32,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:32,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:32,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:32,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:32,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:32,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:32,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:32,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:32,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:32,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:32,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:32,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:32,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:32,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:32,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:32,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:32,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:32,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:32,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:32,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:32,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:32,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:32,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:32,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:32,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:32,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:32,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:32,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:32,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:32,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:32,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:32,065 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:32,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:32,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:32,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:32,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:32,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:32,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:32,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:32,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:32,095 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:32,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:32,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:32,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:32,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:32,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:32,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:32,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:32,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:32,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:32,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:32,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:32,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:32,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:32,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:32,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:32,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:32,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:32,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:32,100 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 -> 11de8b1d34bf28c678335a47cf13777a2fdebca168e06294b055c2a549d4333e [2022-02-20 16:46:32,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:32,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:32,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:32,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:32,336 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:32,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1211a.c [2022-02-20 16:46:32,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e8dd488/0fc3dc98f8da4597a9a0f731643462b9/FLAGb062a3906 [2022-02-20 16:46:32,757 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:32,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1211a.c [2022-02-20 16:46:32,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e8dd488/0fc3dc98f8da4597a9a0f731643462b9/FLAGb062a3906 [2022-02-20 16:46:33,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e8dd488/0fc3dc98f8da4597a9a0f731643462b9 [2022-02-20 16:46:33,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:33,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:33,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:33,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:33,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:33,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae4e200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33, skipping insertion in model container [2022-02-20 16:46:33,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:33,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:33,322 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_1211a.c[2576,2589] [2022-02-20 16:46:33,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:33,330 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:33,367 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_1211a.c[2576,2589] [2022-02-20 16:46:33,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:33,378 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:33,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33 WrapperNode [2022-02-20 16:46:33,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:33,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:33,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:33,390 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:33" (1/1) ... [2022-02-20 16:46:33,396 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:33" (1/1) ... [2022-02-20 16:46:33,417 INFO L137 Inliner]: procedures = 19, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2022-02-20 16:46:33,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:33,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:33,425 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:33" (1/1) ... [2022-02-20 16:46:33,425 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:33" (1/1) ... [2022-02-20 16:46:33,428 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:33" (1/1) ... [2022-02-20 16:46:33,429 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:33" (1/1) ... [2022-02-20 16:46:33,437 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:33" (1/1) ... [2022-02-20 16:46:33,441 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:33" (1/1) ... [2022-02-20 16:46:33,442 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:33" (1/1) ... [2022-02-20 16:46:33,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:33,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:33,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:33,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:33,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:33,469 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:33,475 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:33,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:33,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:33,556 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:33,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:33,846 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:33,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:33,852 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:46:33,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:33 BoogieIcfgContainer [2022-02-20 16:46:33,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:33,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:33,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:33,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:33,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:33" (1/3) ... [2022-02-20 16:46:33,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4411c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:33, skipping insertion in model container [2022-02-20 16:46:33,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (2/3) ... [2022-02-20 16:46:33,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4411c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:33, skipping insertion in model container [2022-02-20 16:46:33,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:33" (3/3) ... [2022-02-20 16:46:33,869 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211a.c [2022-02-20 16:46:33,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:33,874 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:33,911 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:33,916 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:33,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:33,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:33,968 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:33,968 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1888439402, now seen corresponding path program 1 times [2022-02-20 16:46:33,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:33,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068997062] [2022-02-20 16:46:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#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_modf~0 := 1.0; {45#true} is VALID [2022-02-20 16:46:34,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);call write~init~real(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:34,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:34,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {46#false} is VALID [2022-02-20 16:46:34,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume !(modf_float_~j0~0#1 < 23);havoc modf_float_~ix~1#1;call write~real(~someBinaryArithmeticFLOAToperation(modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4); {46#false} is VALID [2022-02-20 16:46:34,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} modf_float_#res#1 := modf_float_~x#1; {46#false} is VALID [2022-02-20 16:46:34,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {46#false} is VALID [2022-02-20 16:46:34,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:34,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} isinf_float_~ix~2#1 := (if 0 == isinf_float_~ix~2#1 then 0 else (if 1 == isinf_float_~ix~2#1 then 1 else ~bitwiseAnd(isinf_float_~ix~2#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~2#1 then 1 else 0); {46#false} is VALID [2022-02-20 16:46:34,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {46#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~ret17#1; {46#false} is VALID [2022-02-20 16:46:34,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {46#false} assume !main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:34,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:34,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:34,144 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:34,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:34,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068997062] [2022-02-20 16:46:34,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068997062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:34,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:34,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:34,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591957993] [2022-02-20 16:46:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:34,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,168 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:34,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:34,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:34,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:34,185 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 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 7.5) internal successors, (15), 2 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:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,237 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2022-02-20 16:46:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:34,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:46:34,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,364 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:34,364 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:34,367 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:34,372 INFO L933 BasicCegarLoop]: 46 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, 46 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:34,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:34,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:34,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,402 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,403 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,407 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:34,412 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,414 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:34,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 16:46:34,422 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-02-20 16:46:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:34,423 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 16:46:34,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:34,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,427 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:34,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:34,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1291452088, now seen corresponding path program 1 times [2022-02-20 16:46:34,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:34,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495460392] [2022-02-20 16:46:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#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_modf~0 := 1.0; {280#true} is VALID [2022-02-20 16:46:34,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);call write~init~real(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {280#true} is VALID [2022-02-20 16:46:34,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {280#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);call modf_float_#t~mem4#1 := read~int(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);modf_float_~i0~0#1 := (if modf_float_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then modf_float_#t~mem4#1 % 4294967296 % 4294967296 else modf_float_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {280#true} is VALID [2022-02-20 16:46:34,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#true} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {280#true} is VALID [2022-02-20 16:46:34,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#true} assume modf_float_~j0~0#1 < 23; {280#true} is VALID [2022-02-20 16:46:34,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#true} assume modf_float_~j0~0#1 < 0; {280#true} is VALID [2022-02-20 16:46:34,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#true} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~int((if 0 == modf_float_~i0~0#1 then 0 else (if 1 == modf_float_~i0~0#1 then 0 else ~bitwiseAnd(modf_float_~i0~0#1, 2147483648))), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call modf_float_#t~mem5#1 := read~real(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call write~real(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {280#true} is VALID [2022-02-20 16:46:34,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#true} modf_float_#res#1 := modf_float_~x#1; {280#true} is VALID [2022-02-20 16:46:34,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#true} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {280#true} is VALID [2022-02-20 16:46:34,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#true} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4);call isinf_float_#t~mem13#1 := read~int(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4);isinf_float_~ix~2#1 := (if isinf_float_#t~mem13#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem13#1 % 4294967296 % 4294967296 else isinf_float_#t~mem13#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {280#true} is VALID [2022-02-20 16:46:34,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#true} goto; {280#true} is VALID [2022-02-20 16:46:34,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {280#true} isinf_float_~ix~2#1 := (if 0 == isinf_float_~ix~2#1 then 0 else (if 1 == isinf_float_~ix~2#1 then 1 else ~bitwiseAnd(isinf_float_~ix~2#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~2#1 then 1 else 0); {280#true} is VALID [2022-02-20 16:46:34,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {280#true} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~ret17#1; {280#true} is VALID [2022-02-20 16:46:34,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {280#true} assume !main_#t~short20#1; {282#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:34,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {282#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {281#false} is VALID [2022-02-20 16:46:34,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {281#false} assume !false; {281#false} is VALID [2022-02-20 16:46:34,576 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:34,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:34,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495460392] [2022-02-20 16:46:34,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495460392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:34,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:34,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:34,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628661886] [2022-02-20 16:46:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:34,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,591 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:34,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:34,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:34,593 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,636 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 16:46:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:46:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:46:34,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 16:46:34,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:34,669 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:46:34,669 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:34,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:34,670 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:34,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:34,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:34,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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,674 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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,674 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,676 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:34,677 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,678 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:34,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:34,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:34,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-02-20 16:46:34,680 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2022-02-20 16:46:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:34,681 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-02-20 16:46:34,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 16:46:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:46:34,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,682 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] [2022-02-20 16:46:34,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:34,682 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -182496670, now seen corresponding path program 1 times [2022-02-20 16:46:34,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:34,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572133484] [2022-02-20 16:46:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:34,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:34,794 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:34,794 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:34,795 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:34,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:34,798 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:34,800 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:34,829 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:34,830 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:34,831 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:46:34,832 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:34,833 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:34,834 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:34,847 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:34,847 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:34,847 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:34,847 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:34,848 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:34,849 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-02-20 16:46:34,850 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:34,850 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:34,850 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:34,850 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:34,850 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:46:34,850 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:34,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:34 BoogieIcfgContainer [2022-02-20 16:46:34,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:34,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:34,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:34,852 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:34,852 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:33" (3/4) ... [2022-02-20 16:46:34,854 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:34,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:34,855 INFO L158 Benchmark]: Toolchain (without parser) took 1664.75ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 55.1MB in the beginning and 112.9MB in the end (delta: -57.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:34,856 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:34,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.27ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 54.9MB in the beginning and 115.8MB in the end (delta: -60.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:34,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.76ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 115.0MB in the end (delta: 782.2kB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:34,857 INFO L158 Benchmark]: Boogie Preprocessor took 25.99ms. Allocated memory is still 138.4MB. Free memory was 115.0MB in the beginning and 112.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:34,857 INFO L158 Benchmark]: RCFGBuilder took 407.97ms. Allocated memory is still 138.4MB. Free memory was 112.9MB in the beginning and 91.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:34,857 INFO L158 Benchmark]: TraceAbstraction took 996.84ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 112.9MB in the end (delta: -21.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:34,858 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 138.4MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:34,859 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.27ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 54.9MB in the beginning and 115.8MB in the end (delta: -60.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.76ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 115.0MB in the end (delta: 782.2kB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.99ms. Allocated memory is still 138.4MB. Free memory was 115.0MB in the beginning and 112.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.97ms. Allocated memory is still 138.4MB. Free memory was 112.9MB in the beginning and 91.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 996.84ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 112.9MB in the end (delta: -21.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 138.4MB. Free memory is still 112.9MB. 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: 112]: 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 111, overapproximation of someBinaryArithmeticFLOAToperation at line 106, overapproximation of bitwiseAnd at line 95. Possible FailurePath: [L14] static const float one_modf = 1.0; VAL [one_modf=1] [L106] float x = 1.0f / 0.0f; [L107] float iptr = __VERIFIER_nondet_float(); [L108] CALL, EXPR modf_float(x, &iptr) [L17] __int32_t i0, j0; [L18] __uint32_t i; VAL [\old(x)=4370464771, iptr={6:0}, iptr={6:0}, one_modf=1, x=4370464771] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (i0) = gf_u.word [L24] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L25] COND TRUE j0 < 23 VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L26] COND TRUE j0 < 0 VAL [\old(x)=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L28] ieee_float_shape_type sf_u; [L29] sf_u.word = (i0 & 0x80000000) [L30] EXPR sf_u.value [L30] (*iptr) = sf_u.value [L32] return x; VAL [\old(x)=4370464771, \result=4370464771, i0=75497472, iptr={6:0}, iptr={6:0}, j0=-127, one_modf=1, x=4370464771] [L108] RET, EXPR modf_float(x, &iptr) [L108] float res = modf_float(x, &iptr); [L111] EXPR \read(iptr) [L111] CALL, EXPR isinf_float(iptr) [L89] __int32_t ix; VAL [\old(x)=4370464769, one_modf=1, x=4370464769] [L91] ieee_float_shape_type gf_u; [L92] gf_u.value = (x) [L93] EXPR gf_u.word [L93] (ix) = gf_u.word [L95] ix &= 0x7fffffff [L96] return ((ix) == 0x7f800000L); VAL [\old(x)=4370464769, \result=1, ix=2139095040, one_modf=1, x=4370464769] [L111] RET, EXPR isinf_float(iptr) [L111] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L111] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [\read(iptr)=4370464769, iptr={6:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=4370464771, res == 0.0f && __signbit_float(res) == 0=0, x=4370464771] [L111] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) VAL [\read(iptr)=4370464769, iptr={6:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=4370464771, res == 0.0f && __signbit_float(res) == 0=0, x=4370464771] [L111] COND TRUE isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L112] reach_error() VAL [iptr={6:0}, one_modf=1, res=4370464771, x=4370464771] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 89 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:34,885 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_1211a.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 11de8b1d34bf28c678335a47cf13777a2fdebca168e06294b055c2a549d4333e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:36,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:36,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:36,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:36,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:36,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:36,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:36,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:36,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:36,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:36,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:36,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:36,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:36,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:36,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:36,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:36,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:36,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:36,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:36,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:36,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:36,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:36,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:36,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:36,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:36,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:36,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:36,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:36,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:36,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:36,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:36,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:36,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:36,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:36,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:36,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:36,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:36,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:36,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:36,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:36,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:36,885 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:36,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:36,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:36,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:36,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:36,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:36,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:36,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:36,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:36,916 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:36,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:36,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:36,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:36,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:36,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:36,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:36,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:36,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:36,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:36,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:36,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:36,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:36,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:36,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:36,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:36,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:36,921 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 -> 11de8b1d34bf28c678335a47cf13777a2fdebca168e06294b055c2a549d4333e [2022-02-20 16:46:37,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:37,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:37,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:37,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:37,215 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:37,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1211a.c [2022-02-20 16:46:37,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889a0cce/0615a577854844d7932056f0700e3cd2/FLAG1f2d02816 [2022-02-20 16:46:37,620 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:37,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1211a.c [2022-02-20 16:46:37,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889a0cce/0615a577854844d7932056f0700e3cd2/FLAG1f2d02816 [2022-02-20 16:46:37,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889a0cce/0615a577854844d7932056f0700e3cd2 [2022-02-20 16:46:37,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:37,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:37,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:37,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:37,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:37,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10fc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37, skipping insertion in model container [2022-02-20 16:46:37,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:37,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:37,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:37,900 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_1211a.c[2576,2589] [2022-02-20 16:46:37,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:37,921 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:37,964 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_1211a.c[2576,2589] [2022-02-20 16:46:37,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:37,980 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:37,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37 WrapperNode [2022-02-20 16:46:37,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:37,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:37,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:37,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:37,987 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:37" (1/1) ... [2022-02-20 16:46:37,994 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:37" (1/1) ... [2022-02-20 16:46:38,021 INFO L137 Inliner]: procedures = 22, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2022-02-20 16:46:38,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:38,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:38,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:38,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:38,029 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:37" (1/1) ... [2022-02-20 16:46:38,030 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:37" (1/1) ... [2022-02-20 16:46:38,033 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:37" (1/1) ... [2022-02-20 16:46:38,034 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:37" (1/1) ... [2022-02-20 16:46:38,041 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:37" (1/1) ... [2022-02-20 16:46:38,045 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:37" (1/1) ... [2022-02-20 16:46:38,046 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:37" (1/1) ... [2022-02-20 16:46:38,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:38,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:38,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:38,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:38,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (1/1) ... [2022-02-20 16:46:38,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:38,081 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:38,098 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:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:38,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:38,174 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:38,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:38,498 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:38,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:38,503 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:46:38,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:38 BoogieIcfgContainer [2022-02-20 16:46:38,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:38,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:38,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:38,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:38,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:37" (1/3) ... [2022-02-20 16:46:38,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b2270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:38, skipping insertion in model container [2022-02-20 16:46:38,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:37" (2/3) ... [2022-02-20 16:46:38,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b2270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:38, skipping insertion in model container [2022-02-20 16:46:38,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:38" (3/3) ... [2022-02-20 16:46:38,511 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211a.c [2022-02-20 16:46:38,516 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:38,516 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:38,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:38,561 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:38,561 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call 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,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:38,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,590 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:38,591 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1888439402, now seen corresponding path program 1 times [2022-02-20 16:46:38,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:38,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539012569] [2022-02-20 16:46:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:38,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:38,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:38,655 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:38,684 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:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:38,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:38,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#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_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {45#true} is VALID [2022-02-20 16:46:38,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:38,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:38,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {46#false} is VALID [2022-02-20 16:46:38,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {46#false} is VALID [2022-02-20 16:46:38,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} modf_float_#res#1 := modf_float_~x#1; {46#false} is VALID [2022-02-20 16:46:38,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {46#false} is VALID [2022-02-20 16:46:38,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:38,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {46#false} is VALID [2022-02-20 16:46:38,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {46#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {46#false} is VALID [2022-02-20 16:46:38,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {46#false} assume !main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:38,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {46#false} is VALID [2022-02-20 16:46:38,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:38,858 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:38,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:38,858 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:38,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539012569] [2022-02-20 16:46:38,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539012569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:38,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:38,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:38,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118817500] [2022-02-20 16:46:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:38,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:38,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:38,916 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:38,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:38,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:38,944 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 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 7.5) internal successors, (15), 2 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:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,050 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2022-02-20 16:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:46:39,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:46:39,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:39,232 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:39,232 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:39,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:39,239 INFO L933 BasicCegarLoop]: 46 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, 46 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:39,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:39,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:39,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:39,266 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:39,267 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,271 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:39,276 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,279 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:46:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:39,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 16:46:39,289 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-02-20 16:46:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:39,294 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 16:46:39,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:46:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:39,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:39,295 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:39,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:39,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1291452088, now seen corresponding path program 1 times [2022-02-20 16:46:39,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:39,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526315771] [2022-02-20 16:46:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:39,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:39,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:39,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {322#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_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {322#true} is VALID [2022-02-20 16:46:39,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {330#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:39,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:39,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:39,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {341#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:39,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|)))} assume ~bvslt32(modf_float_~j0~0#1, 23bv32); {323#false} is VALID [2022-02-20 16:46:39,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#false} assume ~bvslt32(modf_float_~j0~0#1, 0bv32); {323#false} is VALID [2022-02-20 16:46:39,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#false} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~i0~0#1), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call modf_float_#t~mem5#1 := read~intFLOATTYPE4(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call write~intFLOATTYPE4(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {323#false} is VALID [2022-02-20 16:46:39,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#false} goto; {323#false} is VALID [2022-02-20 16:46:39,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#false} modf_float_#res#1 := modf_float_~x#1; {323#false} is VALID [2022-02-20 16:46:39,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {323#false} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {323#false} is VALID [2022-02-20 16:46:39,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {323#false} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {323#false} is VALID [2022-02-20 16:46:39,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#false} goto; {323#false} is VALID [2022-02-20 16:46:39,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#false} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {323#false} is VALID [2022-02-20 16:46:39,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {323#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {323#false} is VALID [2022-02-20 16:46:39,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#false} assume !main_#t~short20#1; {323#false} is VALID [2022-02-20 16:46:39,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {323#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {323#false} is VALID [2022-02-20 16:46:39,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {323#false} assume !false; {323#false} is VALID [2022-02-20 16:46:39,818 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:39,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:39,818 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:39,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526315771] [2022-02-20 16:46:39,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526315771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:39,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:39,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:39,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682666904] [2022-02-20 16:46:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:39,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:39,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:39,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:39,844 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:39,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:39,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:39,845 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,004 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-02-20 16:46:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:40,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 16:46:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 16:46:40,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-02-20 16:46:40,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,102 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:46:40,102 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:40,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:40,103 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:40,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:40,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:40,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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,106 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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,106 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,108 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:46:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:40,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 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 26 states. [2022-02-20 16:46:40,109 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 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 26 states. [2022-02-20 16:46:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,110 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:46:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:40,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:40,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 16:46:40,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2022-02-20 16:46:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:40,117 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 16:46:40,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:46:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:40,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:40,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:40,132 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:40,326 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:40,327 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1647807069, now seen corresponding path program 1 times [2022-02-20 16:46:40,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:40,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031609038] [2022-02-20 16:46:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:40,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:40,330 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:40,348 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:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:46:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:40,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#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_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {534#true} is VALID [2022-02-20 16:46:40,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {534#true} is VALID [2022-02-20 16:46:40,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {534#true} is VALID [2022-02-20 16:46:40,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {534#true} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#true} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {534#true} is VALID [2022-02-20 16:46:40,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {534#true} modf_float_#res#1 := modf_float_~x#1; {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {534#true} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#true} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} goto; {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {534#true} is VALID [2022-02-20 16:46:40,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {534#true} is VALID [2022-02-20 16:46:40,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {534#true} assume !main_#t~short20#1; {587#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:40,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {587#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {535#false} is VALID [2022-02-20 16:46:40,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-02-20 16:46:40,524 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,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:40,525 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:40,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031609038] [2022-02-20 16:46:40,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031609038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:40,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:40,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:40,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115153333] [2022-02-20 16:46:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:46:40,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:40,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:40,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:40,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:40,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:40,580 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,711 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 16:46:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:40,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:46:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-20 16:46:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-20 16:46:40,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-20 16:46:40,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,765 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:46:40,765 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:40,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:40,766 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:40,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:40,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:40,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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:40,768 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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:40,768 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,769 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-02-20 16:46:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:40,770 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:40,771 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-02-20 16:46:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:40,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:40,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:40,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-02-20 16:46:40,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2022-02-20 16:46:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:40,773 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-02-20 16:46:40,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-02-20 16:46:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:46:40,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:40,773 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] [2022-02-20 16:46:40,787 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:40,982 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:40,983 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1322743609, now seen corresponding path program 1 times [2022-02-20 16:46:40,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:40,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022811564] [2022-02-20 16:46:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:40,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:40,985 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:40,986 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:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:41,184 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:41,290 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 54 treesize of output 30 [2022-02-20 16:46:41,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#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_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {714#true} is VALID [2022-02-20 16:46:41,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {714#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:41,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:41,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:41,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:41,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:41,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {738#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:41,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} goto; {738#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:41,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start_modf_float_~ix~1#1|)))} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {745#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} goto; {745#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {745#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_modf_float_~x#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} modf_float_#res#1 := modf_float_~x#1; {752#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:41,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {752#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_#res#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32))))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} goto; {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} is VALID [2022-02-20 16:46:41,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_1 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_1 (_ bv2147483648 32)))))))} assume main_#t~short20#1;main_#t~short19#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {772#|ULTIMATE.start_main_#t~short19#1|} is VALID [2022-02-20 16:46:41,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#|ULTIMATE.start_main_#t~short19#1|} assume !main_#t~short19#1; {715#false} is VALID [2022-02-20 16:46:41,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {715#false} main_#t~short20#1 := !main_#t~short19#1; {715#false} is VALID [2022-02-20 16:46:41,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {715#false} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {715#false} is VALID [2022-02-20 16:46:41,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {715#false} assume !false; {715#false} is VALID [2022-02-20 16:46:41,672 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:41,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:41,672 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:41,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022811564] [2022-02-20 16:46:41,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022811564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:41,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:41,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:46:41,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12701075] [2022-02-20 16:46:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:41,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 16:46:41,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:41,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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:41,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:46:41,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:46:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:46:41,747 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,022 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2022-02-20 16:46:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:46:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 16:46:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 16:46:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 16:46:42,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-02-20 16:46:42,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,101 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:42,101 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:42,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:46:42,102 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-02-20 16:46:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:42,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 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:42,104 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 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:42,104 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 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:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,105 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:42,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:42,105 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,106 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:42,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 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:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2022-02-20 16:46:42,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 21 [2022-02-20 16:46:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,108 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2022-02-20 16:46:42,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call 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,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2022-02-20 16:46:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:42,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,109 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:42,120 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:42,320 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:42,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1202751826, now seen corresponding path program 1 times [2022-02-20 16:46:42,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:42,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259916551] [2022-02-20 16:46:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:42,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:42,323 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:42,327 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:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:46:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:42,544 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:42,598 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 54 treesize of output 30 [2022-02-20 16:46:43,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {906#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_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {906#true} is VALID [2022-02-20 16:46:43,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~mem16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~short19#1, main_#t~short20#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~intFLOATTYPE4(main_#t~nondet14#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);havoc main_#t~nondet14#1;assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:43,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:43,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:43,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:43,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:43,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {930#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_~ix~1#1| (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:43,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_~ix~1#1| (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} goto; {930#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_~ix~1#1| (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:43,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(exists ((|v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start_modf_float_~ix~1#1| (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_modf_float_~#gf_u~2#1.base_9|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {937#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_~x#1|)))} is VALID [2022-02-20 16:46:43,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_~x#1|)))} goto; {937#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_~x#1|)))} is VALID [2022-02-20 16:46:43,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {937#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_~x#1|)))} modf_float_#res#1 := modf_float_~x#1; {944#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_#res#1|)))} is VALID [2022-02-20 16:46:43,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_modf_float_#res#1|)))} main_#t~ret15#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;call main_#t~mem16#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32);assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_#t~mem16#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem13#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, isinf_float_~x#1, isinf_float_~ix~2#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~2#1; {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} call isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);call isinf_float_#t~mem13#1 := read~intINTTYPE4(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset, 4bv32);isinf_float_~ix~2#1 := isinf_float_#t~mem13#1;havoc isinf_float_#t~mem13#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset);havoc isinf_float_~#gf_u~4#1.base, isinf_float_~#gf_u~4#1.offset; {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} goto; {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} isinf_float_~ix~2#1 := ~bvand32(2147483647bv32, isinf_float_~ix~2#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~2#1 then 1bv32 else 0bv32); {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;main_#t~short20#1 := 0bv32 != main_#t~ret17#1; {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} assume main_#t~short20#1;main_#t~short19#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {948#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} assume main_#t~short19#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~3#1.base, __signbit_float_~#gf_u~3#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; {967#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start___signbit_float_~x#1|)))} is VALID [2022-02-20 16:46:43,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) |ULTIMATE.start___signbit_float_~x#1|)))} call __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, 4bv32);call __signbit_float_#t~mem12#1 := read~intINTTYPE4(__signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#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~3#1.base, __signbit_float_~#gf_u~3#1.offset);havoc __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset; {971#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {971#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} goto; {971#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} is VALID [2022-02-20 16:46:43,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {971#(exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {978#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))))))} is VALID [2022-02-20 16:46:43,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 30 23) (bvand v_arrayElimCell_2 (_ bv2147483648 32))) ((_ extract 22 0) (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (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|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))))))} main_#t~ret18#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short19#1 := 0bv32 == main_#t~ret18#1; {982#|ULTIMATE.start_main_#t~short19#1|} is VALID [2022-02-20 16:46:43,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {982#|ULTIMATE.start_main_#t~short19#1|} main_#t~short20#1 := !main_#t~short19#1; {986#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:46:43,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {986#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1;havoc main_#t~mem16#1;havoc main_#t~ret17#1;havoc main_#t~ret18#1;havoc main_#t~short19#1;havoc main_#t~short20#1; {907#false} is VALID [2022-02-20 16:46:43,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-02-20 16:46:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:43,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:43,471 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:43,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259916551] [2022-02-20 16:46:43,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259916551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:43,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:43,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 16:46:43,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191325033] [2022-02-20 16:46:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:43,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,545 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:43,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:46:43,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:43,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:46:43,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:46:43,547 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:43,904 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:46:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:46:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-02-20 16:46:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-02-20 16:46:43,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2022-02-20 16:46:43,984 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:43,984 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:46:43,984 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:43,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:46:43,985 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:43,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-02-20 16:46:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:43,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:43,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,986 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,986 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:43,986 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:43,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:43,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:43,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:43,986 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:43,986 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:43,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:43,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:43,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:43,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:43,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:46:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:43,987 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:43,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:43,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:43,989 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:44,001 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:44,199 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:44,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:44,306 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 31) the Hoare annotation is: false [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 23) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:46:44,307 INFO L854 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (let ((.cse0 (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start___signbit_float_~x#1|)))) [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L111-3(line 111) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L78-3(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L111-5(lines 111 114) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L854 garLoopResultBuilder]: At program point L71(lines 16 73) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (= (let ((.cse0 (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start_modf_float_#res#1|))) [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 42) the Hoare annotation is: false [2022-02-20 16:46:44,308 INFO L854 garLoopResultBuilder]: At program point L96(lines 88 97) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (let ((.cse0 (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (let ((.cse0 (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) |ULTIMATE.start_main_~res~0#1|) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2022-02-20 16:46:44,308 INFO L858 garLoopResultBuilder]: For program point L90-3(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 70) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 58 72) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L66-2(lines 66 70) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 72) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L861 garLoopResultBuilder]: At program point L116(lines 99 117) the Hoare annotation is: true [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L854 garLoopResultBuilder]: At program point L50-2(lines 50 54) the Hoare annotation is: false [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L50-3(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 57) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L854 garLoopResultBuilder]: At program point L84(lines 75 85) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (let ((.cse0 (bvand v_arrayElimCell_2 (_ bv2147483648 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (let ((.cse1 (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse1) (and (not .cse1) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)))))))) [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 35 49) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:44,309 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 56) no Hoare annotation was computed. [2022-02-20 16:46:44,312 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:46:44,313 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:44,315 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:46:44,316 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L90-3 has no Hoare annotation [2022-02-20 16:46:44,319 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-5 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:44,320 WARN L170 areAnnotationChecker]: L111-3 has no Hoare annotation [2022-02-20 16:46:44,320 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,335 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,335 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:44 BoogieIcfgContainer [2022-02-20 16:46:44,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:44,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:44,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:44,341 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:44,342 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:38" (3/4) ... [2022-02-20 16:46:44,349 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:44,371 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-02-20 16:46:44,371 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 16:46:44,371 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:44,371 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:44,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:44,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:44,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0]) && ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == \result) [2022-02-20 16:46:44,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == res && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) [2022-02-20 16:46:44,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == res && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) [2022-02-20 16:46:44,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == 0.0f && __signbit_float(res) == 0-aux && (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0]) && ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == x) [2022-02-20 16:46:44,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == 0.0f && __signbit_float(res) == 0-aux && (\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) && ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32))) [2022-02-20 16:46:44,406 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:44,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:44,407 INFO L158 Benchmark]: Toolchain (without parser) took 6746.83ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 42.7MB in the beginning and 45.1MB in the end (delta: -2.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,407 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.98ms. Allocated memory is still 58.7MB. Free memory was 42.5MB in the beginning and 38.4MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.37ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 33.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: RCFGBuilder took 455.01ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 28.2MB in the end (delta: 5.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: TraceAbstraction took 5835.52ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 27.7MB in the beginning and 49.3MB in the end (delta: -21.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,408 INFO L158 Benchmark]: Witness Printer took 65.19ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 45.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:44,410 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.98ms. Allocated memory is still 58.7MB. Free memory was 42.5MB in the beginning and 38.4MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.37ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 33.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.01ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 28.2MB in the end (delta: 5.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5835.52ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 27.7MB in the beginning and 49.3MB in the end (delta: -21.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 65.19ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 45.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 112]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 381 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 125 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 209 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 96 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 93 ConstructedInterpolants, 39 QuantifiedInterpolants, 1042 SizeOfPredicates, 32 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] Derived loop invariant: aux-res == 0.0f && __signbit_float(res) == 0-aux && (\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) && ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32))) - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 88]: Loop Invariant [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == res && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 78]: Loop Invariant [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] Derived loop invariant: aux-res == 0.0f && __signbit_float(res) == 0-aux && (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0]) && ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == x) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0]) && ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == \result) - InvariantResult [Line: 90]: Loop Invariant [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_2,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode, v_arrayElimCell_2 : bv32 :: ~fp~LONGDOUBLE(~bvand32(v_arrayElimCell_2, 2147483648bv32)[31:31], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[30:23], ~bvand32(v_arrayElimCell_2, 2147483648bv32)[22:0]) == res && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_2[31:31], v_arrayElimCell_2[30:23], v_arrayElimCell_2[22:0])) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:44,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:44,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE