./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1121a.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_1121a.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 a675a014adb554d3b3cb02e2742644f85bc00ae7c696ead14730bf8198b2dce7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:18,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:18,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:19,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:19,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:19,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:19,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:19,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:19,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:19,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:19,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:19,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:19,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:19,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:19,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:19,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:19,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:19,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:19,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:19,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:19,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:19,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:19,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:19,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:19,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:19,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:19,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:19,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:19,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:19,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:19,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:19,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:19,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:19,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:19,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:19,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:19,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:19,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:19,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:19,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:19,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:19,061 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:19,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:19,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:19,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:19,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:19,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:19,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:19,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:19,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:19,091 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:19,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:19,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:19,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:19,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:19,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:19,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:19,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:19,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:19,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:19,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:19,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:19,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:19,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:19,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:19,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:19,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:19,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:19,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:19,096 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 -> a675a014adb554d3b3cb02e2742644f85bc00ae7c696ead14730bf8198b2dce7 [2022-02-20 16:46:19,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:19,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:19,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:19,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:19,303 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:19,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1121a.c [2022-02-20 16:46:19,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc8ef062/c52066074f0b49b89d26a1d2133adb74/FLAGcf7b23383 [2022-02-20 16:46:19,682 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:19,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1121a.c [2022-02-20 16:46:19,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc8ef062/c52066074f0b49b89d26a1d2133adb74/FLAGcf7b23383 [2022-02-20 16:46:19,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc8ef062/c52066074f0b49b89d26a1d2133adb74 [2022-02-20 16:46:19,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:19,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:19,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:19,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:19,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922521a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19, skipping insertion in model container [2022-02-20 16:46:19,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:19,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:19,884 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_1121a.c[2701,2714] [2022-02-20 16:46:19,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,893 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:19,920 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_1121a.c[2701,2714] [2022-02-20 16:46:19,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,930 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:19,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19 WrapperNode [2022-02-20 16:46:19,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:19,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:19,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,948 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:19" (1/1) ... [2022-02-20 16:46:19,978 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 205 [2022-02-20 16:46:19,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:19,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:19,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:19,985 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:19" (1/1) ... [2022-02-20 16:46:19,985 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:19" (1/1) ... [2022-02-20 16:46:19,988 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:19" (1/1) ... [2022-02-20 16:46:19,988 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:19" (1/1) ... [2022-02-20 16:46:19,995 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:19" (1/1) ... [2022-02-20 16:46:19,999 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:19" (1/1) ... [2022-02-20 16:46:20,000 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:19" (1/1) ... [2022-02-20 16:46:20,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:20,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:20,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:20,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:20,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:20,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:20,030 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:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:20,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:20,126 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:20,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:20,490 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:20,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:20,496 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:20,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20 BoogieIcfgContainer [2022-02-20 16:46:20,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:20,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:20,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:20,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:20,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:19" (1/3) ... [2022-02-20 16:46:20,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101fbdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (2/3) ... [2022-02-20 16:46:20,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101fbdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20" (3/3) ... [2022-02-20 16:46:20,513 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1121a.c [2022-02-20 16:46:20,516 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:20,516 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:20,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:20,554 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:20,555 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:20,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:20,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:20,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1366069876, now seen corresponding path program 1 times [2022-02-20 16:46:20,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:20,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127728195] [2022-02-20 16:46:20,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:20,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {57#true} is VALID [2022-02-20 16:46:20,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;main_~y~0#1 := 0.0;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {57#true} is VALID [2022-02-20 16:46:20,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:46:20,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} assume !true; {58#false} is VALID [2022-02-20 16:46:20,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {58#false} is VALID [2022-02-20 16:46:20,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {58#false} is VALID [2022-02-20 16:46:20,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {58#false} is VALID [2022-02-20 16:46:20,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {58#false} main_#t~ret16#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {58#false} is VALID [2022-02-20 16:46:20,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {58#false} main_#t~ret17#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {58#false} is VALID [2022-02-20 16:46:20,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#false} assume 0 == main_#t~ret17#1;havoc main_#t~ret17#1; {58#false} is VALID [2022-02-20 16:46:20,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:46:20,718 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:20,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:20,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127728195] [2022-02-20 16:46:20,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127728195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:20,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:20,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:20,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999630950] [2022-02-20 16:46:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:20,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:20,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:20,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:20,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:20,769 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,855 INFO L93 Difference]: Finished difference Result 106 states and 186 transitions. [2022-02-20 16:46:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:20,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2022-02-20 16:46:21,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,014 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:46:21,014 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:46:21,016 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:21,020 INFO L933 BasicCegarLoop]: 73 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, 73 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:21,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 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:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:46:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:46:21,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:21,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,043 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,043 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,046 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:21,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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 51 states. [2022-02-20 16:46:21,047 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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 51 states. [2022-02-20 16:46:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,051 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:21,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:21,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-02-20 16:46:21,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 11 [2022-02-20 16:46:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:21,060 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-02-20 16:46:21,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:21,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:21,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:21,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:21,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1947332695, now seen corresponding path program 1 times [2022-02-20 16:46:21,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:21,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849452528] [2022-02-20 16:46:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:21,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:21,208 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:21,209 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:21,210 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:21,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:21,215 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:21,217 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:21,236 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:21,237 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:21,238 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:21,239 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:21,241 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:21,242 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:21,243 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:21,244 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:21,245 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:21,246 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:21,246 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:21,246 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:21,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:21 BoogieIcfgContainer [2022-02-20 16:46:21,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:21,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:21,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:21,248 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:21,248 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:20" (3/4) ... [2022-02-20 16:46:21,254 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:21,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:21,256 INFO L158 Benchmark]: Toolchain (without parser) took 1554.16ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 58.5MB in the beginning and 95.1MB in the end (delta: -36.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,256 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:21,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.78ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 64.7MB in the end (delta: -6.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.99ms. Allocated memory is still 92.3MB. Free memory was 64.7MB in the beginning and 61.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,262 INFO L158 Benchmark]: Boogie Preprocessor took 23.01ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,263 INFO L158 Benchmark]: RCFGBuilder took 502.46ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 59.2MB in the beginning and 95.6MB in the end (delta: -36.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,264 INFO L158 Benchmark]: TraceAbstraction took 740.54ms. Allocated memory is still 119.5MB. Free memory was 95.6MB in the beginning and 44.1MB in the end (delta: 51.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,266 INFO L158 Benchmark]: Witness Printer took 6.76ms. Allocated memory is still 119.5MB. Free memory was 44.1MB in the beginning and 95.1MB in the end (delta: -51.0MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:21,272 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 92.3MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.78ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 64.7MB in the end (delta: -6.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.99ms. Allocated memory is still 92.3MB. Free memory was 64.7MB in the beginning and 61.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.01ms. Allocated memory is still 92.3MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 502.46ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 59.2MB in the beginning and 95.6MB in the end (delta: -36.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 740.54ms. Allocated memory is still 119.5MB. Free memory was 95.6MB in the beginning and 44.1MB in the end (delta: 51.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 6.76ms. Allocated memory is still 119.5MB. Free memory was 44.1MB in the beginning and 95.1MB in the end (delta: -51.0MB). Peak memory consumption was 2.6MB. 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: 125]: 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 110, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of bitwiseXOr at line 33, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L118] float x = __VERIFIER_nondet_float(); [L119] float y = 0.0f; [L121] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967305, \old(y)=0, one_fmod=1, x=4294967305, y=0, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967305, \old(y)=0, hx=0, hy=7, one_fmod=1, sx=0, x=4294967305, y=0, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967305, \old(y)=0, hx=0, hy=0, one_fmod=1, sx=0, x=4294967305, y=0, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967305, \old(y)=0, hx=0, hy=0, one_fmod=1, sx=0, x=4294967305, y=0, Zero_fmod={4:0}] [L121] RET, EXPR fmod_float(x, y) [L121] float res = fmod_float(x, y); [L124] CALL, EXPR isnan_float(res) [L110] return x != x; VAL [\old(x)=4294967304, \result=0, one_fmod=1, x=4294967304, Zero_fmod={4:0}] [L124] RET, EXPR isnan_float(res) [L124] COND TRUE !isnan_float(res) [L125] reach_error() VAL [one_fmod=1, res=4294967304, x=4294967305, y=0, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:21,300 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_1121a.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 a675a014adb554d3b3cb02e2742644f85bc00ae7c696ead14730bf8198b2dce7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:22,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:22,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:22,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:22,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:22,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:22,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:22,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:22,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:22,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:22,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:22,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:22,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:22,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:22,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:22,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:22,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:22,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:22,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:22,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:22,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:22,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:22,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:22,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:22,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:22,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:22,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:22,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:22,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:22,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:22,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:22,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:22,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:22,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:22,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:22,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:22,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:22,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:22,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:22,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:22,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:22,986 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:23,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:23,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:23,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:23,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:23,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:23,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:23,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:23,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:23,017 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:23,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:23,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:23,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:23,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:23,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:23,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:23,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:23,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:23,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:23,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:23,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:23,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:23,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:23,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:23,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:23,024 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:23,024 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:23,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:23,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:23,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:23,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:23,025 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 -> a675a014adb554d3b3cb02e2742644f85bc00ae7c696ead14730bf8198b2dce7 [2022-02-20 16:46:23,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:23,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:23,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:23,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:23,292 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:23,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1121a.c [2022-02-20 16:46:23,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b4025dc/788aba9771b94c78aa7b136a8dec61b0/FLAG592ff83d8 [2022-02-20 16:46:23,726 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:23,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1121a.c [2022-02-20 16:46:23,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b4025dc/788aba9771b94c78aa7b136a8dec61b0/FLAG592ff83d8 [2022-02-20 16:46:23,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b4025dc/788aba9771b94c78aa7b136a8dec61b0 [2022-02-20 16:46:23,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:23,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:23,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:23,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:23,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:23,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1169ee28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23, skipping insertion in model container [2022-02-20 16:46:23,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:23,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:23,976 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_1121a.c[2701,2714] [2022-02-20 16:46:23,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:23,997 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:24,040 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_1121a.c[2701,2714] [2022-02-20 16:46:24,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:24,063 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:24,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24 WrapperNode [2022-02-20 16:46:24,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:24,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:24,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:24,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:24,075 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:24" (1/1) ... [2022-02-20 16:46:24,082 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:24" (1/1) ... [2022-02-20 16:46:24,116 INFO L137 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-02-20 16:46:24,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:24,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:24,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:24,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:24,124 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:24" (1/1) ... [2022-02-20 16:46:24,125 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:24" (1/1) ... [2022-02-20 16:46:24,139 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:24" (1/1) ... [2022-02-20 16:46:24,141 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:24" (1/1) ... [2022-02-20 16:46:24,149 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:24" (1/1) ... [2022-02-20 16:46:24,154 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:24" (1/1) ... [2022-02-20 16:46:24,160 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:24" (1/1) ... [2022-02-20 16:46:24,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:24,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:24,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:24,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:24,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24" (1/1) ... [2022-02-20 16:46:24,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:24,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:24,201 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:24,204 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:24,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:24,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:24,328 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:24,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:26,623 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:26,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:26,628 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:26,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:26 BoogieIcfgContainer [2022-02-20 16:46:26,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:26,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:26,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:26,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:26,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:23" (1/3) ... [2022-02-20 16:46:26,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9c698d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:26, skipping insertion in model container [2022-02-20 16:46:26,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24" (2/3) ... [2022-02-20 16:46:26,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9c698d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:26, skipping insertion in model container [2022-02-20 16:46:26,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:26" (3/3) ... [2022-02-20 16:46:26,635 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1121a.c [2022-02-20 16:46:26,639 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:26,639 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:26,671 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:26,675 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:26,676 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:26,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:26,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:26,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 666555284, now seen corresponding path program 1 times [2022-02-20 16:46:26,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:26,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436528552] [2022-02-20 16:46:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:26,709 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:26,710 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:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:26,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:26,983 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_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {45#true} is VALID [2022-02-20 16:46:26,984 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~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:26,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:26,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:26,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {46#false} is VALID [2022-02-20 16:46:26,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {46#false} is VALID [2022-02-20 16:46:26,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {46#false} is VALID [2022-02-20 16:46:26,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {46#false} is VALID [2022-02-20 16:46:26,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {46#false} is VALID [2022-02-20 16:46:26,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:26,988 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:26,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:26,989 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:26,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436528552] [2022-02-20 16:46:26,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436528552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:26,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:26,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:26,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095495728] [2022-02-20 16:46:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:26,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:26,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:27,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:27,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:27,244 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:29,946 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2022-02-20 16:46:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:29,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 138 transitions. [2022-02-20 16:46:30,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:30,560 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:30,560 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:30,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:30,565 INFO L933 BasicCegarLoop]: 57 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, 57 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:30,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 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:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:30,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:30,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:30,584 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:30,585 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:30,587 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:30,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:30,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:30,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 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:30,589 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 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:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:30,590 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:30,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:30,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:30,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:30,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-20 16:46:30,594 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 10 [2022-02-20 16:46:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:30,594 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-20 16:46:30,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:30,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:30,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:30,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:30,805 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:30,806 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 131116369, now seen corresponding path program 1 times [2022-02-20 16:46:30,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:30,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939835022] [2022-02-20 16:46:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:30,809 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:30,810 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:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:35,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {309#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:35,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:35,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {332#(exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))) |ULTIMATE.start_fmod_float_#res#1|))} is VALID [2022-02-20 16:46:35,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24))) |ULTIMATE.start_fmod_float_#res#1|))} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:35,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} is VALID [2022-02-20 16:46:35,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {305#false} is VALID [2022-02-20 16:46:35,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-02-20 16:46:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:35,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:35,486 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:35,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939835022] [2022-02-20 16:46:35,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939835022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:35,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:35,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:35,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230427858] [2022-02-20 16:46:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:35,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:35,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:35,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:35,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:35,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:35,896 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:38,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:46:40,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:46:41,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:46:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,105 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 16:46:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:46:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:46:55,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-02-20 16:46:55,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:55,571 INFO L225 Difference]: With dead ends: 44 [2022-02-20 16:46:55,571 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:55,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:55,573 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:55,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 191 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 10 Unchecked, 5.7s Time] [2022-02-20 16:46:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:55,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:55,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,582 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,582 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,586 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:55,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:55,590 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,592 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:55,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:55,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:55,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:55,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-20 16:46:55,596 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 12 [2022-02-20 16:46:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:55,597 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-20 16:46:55,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:55,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:55,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:55,614 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:55,807 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:55,807 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -302456811, now seen corresponding path program 1 times [2022-02-20 16:46:55,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:55,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843637791] [2022-02-20 16:46:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:55,813 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:55,814 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:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:55,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:56,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {531#true} is VALID [2022-02-20 16:46:56,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} goto; {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} goto; {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:56,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (_ +zero 8 24))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {532#false} is VALID [2022-02-20 16:46:56,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#false} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {532#false} is VALID [2022-02-20 16:46:56,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {532#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {532#false} is VALID [2022-02-20 16:46:56,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {532#false} is VALID [2022-02-20 16:46:56,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {532#false} is VALID [2022-02-20 16:46:56,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-02-20 16:46:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:56,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:56,068 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:56,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843637791] [2022-02-20 16:46:56,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843637791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:56,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:56,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:56,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662555439] [2022-02-20 16:46:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:56,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:56,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:56,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:56,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:56,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:56,084 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:56,182 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-02-20 16:46:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-02-20 16:46:56,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2022-02-20 16:46:56,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:56,283 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:46:56,283 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:56,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:56,285 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:56,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:56,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:56,286 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:56,286 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:56,286 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:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:56,286 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:56,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:56,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:56,286 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:56,286 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:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:56,287 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:56,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:56,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:56,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:56,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:56,287 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:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:56,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 16:46:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:56,288 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:56,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:56,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:56,290 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:56,298 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:56,498 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:56,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:57,747 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L854 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,748 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L861 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: true [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (_ +zero 8 24)))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_fmod_float_#res#1|)) (= |ULTIMATE.start_fmod_float_~y#1| (_ +zero 8 24)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:57,749 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 127) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:57,750 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:57,752 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:57,753 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:57,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:57,764 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:57,764 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:57,764 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:57,764 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:57,765 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:57,909 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:57,910 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:57,911 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:57,911 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:57,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:57 BoogieIcfgContainer [2022-02-20 16:46:57,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:57,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:57,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:57,921 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:57,921 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:26" (3/4) ... [2022-02-20 16:46:57,928 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:57,937 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:46:57,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:46:57,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:57,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:57,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:57,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:57,964 INFO L158 Benchmark]: Toolchain (without parser) took 34212.81ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 29.1MB in the beginning and 30.4MB in the end (delta: -1.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,965 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:57,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.46ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.9MB in the beginning and 44.0MB in the end (delta: -15.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.08ms. Allocated memory is still 65.0MB. Free memory was 44.0MB in the beginning and 41.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,965 INFO L158 Benchmark]: Boogie Preprocessor took 54.91ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 39.4MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,966 INFO L158 Benchmark]: RCFGBuilder took 2455.66ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 35.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,966 INFO L158 Benchmark]: TraceAbstraction took 31290.46ms. Allocated memory is still 65.0MB. Free memory was 34.7MB in the beginning and 32.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,966 INFO L158 Benchmark]: Witness Printer took 42.98ms. Allocated memory is still 65.0MB. Free memory was 32.8MB in the beginning and 30.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:57,967 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.46ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.9MB in the beginning and 44.0MB in the end (delta: -15.1MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.08ms. Allocated memory is still 65.0MB. Free memory was 44.0MB in the beginning and 41.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.91ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 39.4MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2455.66ms. Allocated memory is still 65.0MB. Free memory was 39.4MB in the beginning and 35.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31290.46ms. Allocated memory is still 65.0MB. Free memory was 34.7MB in the beginning and 32.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Witness Printer took 42.98ms. Allocated memory is still 65.0MB. Free memory was 32.8MB in the beginning and 30.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 125]: 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: 31.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 111 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 37 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 1 QuantifiedInterpolants, 116 SizeOfPredicates, 15 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 110]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:46:57,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~Pluszero~LONGDOUBLE() && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,985 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:57,985 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:46:57,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\exists ULTIMATE.start_fmod_float_~x#1 : C_FLOAT :: ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ULTIMATE.start_fmod_float_~x#1, ~Pluszero~LONGDOUBLE()), ~fp.mul~FLOAT(~roundNearestTiesToEven, ULTIMATE.start_fmod_float_~x#1, ~Pluszero~LONGDOUBLE())) == \result) && y == ~Pluszero~LONGDOUBLE()) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:58,110 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