./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0621a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_0621a.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 93ec260cb84d051ded8af47768b754d2a933d99ce3d516511a560eef2f740c5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:50:43,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:50:43,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:50:43,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:50:43,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:50:43,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:50:43,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:50:43,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:50:43,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:50:43,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:50:43,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:50:43,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:50:43,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:50:43,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:50:43,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:50:43,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:50:43,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:50:43,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:50:43,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:50:43,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:50:43,260 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:50:43,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:50:43,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:50:43,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:50:43,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:50:43,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:50:43,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:50:43,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:50:43,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:50:43,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:50:43,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:50:43,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:50:43,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:50:43,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:50:43,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:50:43,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:50:43,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:50:43,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:50:43,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:50:43,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:50:43,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:50:43,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:50:43,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:50:43,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:50:43,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:50:43,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:50:43,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:50:43,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:50:43,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:50:43,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:50:43,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:50:43,301 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:50:43,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:50:43,301 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:50:43,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:50:43,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:50:43,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:50:43,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:50:43,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:50:43,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:50:43,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:50:43,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:50:43,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:50:43,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:50:43,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:50:43,304 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 -> 93ec260cb84d051ded8af47768b754d2a933d99ce3d516511a560eef2f740c5a [2022-07-21 01:50:43,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:50:43,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:50:43,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:50:43,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:50:43,578 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:50:43,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0621a.c [2022-07-21 01:50:43,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4233054/8695a492ac5d4cc6852b1950700c465a/FLAG5e45ea8ed [2022-07-21 01:50:43,976 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:50:43,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0621a.c [2022-07-21 01:50:43,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4233054/8695a492ac5d4cc6852b1950700c465a/FLAG5e45ea8ed [2022-07-21 01:50:44,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4233054/8695a492ac5d4cc6852b1950700c465a [2022-07-21 01:50:44,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:50:44,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:50:44,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:50:44,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:50:44,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:50:44,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f38d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44, skipping insertion in model container [2022-07-21 01:50:44,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:50:44,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:50:44,212 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_0621a.c[3196,3209] [2022-07-21 01:50:44,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:50:44,237 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:50:44,279 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_0621a.c[3196,3209] [2022-07-21 01:50:44,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:50:44,294 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:50:44,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44 WrapperNode [2022-07-21 01:50:44,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:50:44,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:50:44,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:50:44,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:50:44,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,346 INFO L137 Inliner]: procedures = 19, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-07-21 01:50:44,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:50:44,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:50:44,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:50:44,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:50:44,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:50:44,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:50:44,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:50:44,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:50:44,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (1/1) ... [2022-07-21 01:50:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:50:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:50:44,415 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-07-21 01:50:44,428 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-07-21 01:50:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:50:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:50:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:50:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-21 01:50:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:50:44,551 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:50:44,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:50:44,742 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:50:44,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:50:44,747 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 01:50:44,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:44 BoogieIcfgContainer [2022-07-21 01:50:44,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:50:44,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:50:44,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:50:44,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:50:44,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:50:44" (1/3) ... [2022-07-21 01:50:44,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4af2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:50:44, skipping insertion in model container [2022-07-21 01:50:44,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:44" (2/3) ... [2022-07-21 01:50:44,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4af2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:50:44, skipping insertion in model container [2022-07-21 01:50:44,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:44" (3/3) ... [2022-07-21 01:50:44,753 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0621a.c [2022-07-21 01:50:44,763 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:50:44,763 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:50:44,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:50:44,796 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ff8529e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55b25d73 [2022-07-21 01:50:44,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:50:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:50:44,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:50:44,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:50:44,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:50:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:50:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1830079148, now seen corresponding path program 1 times [2022-07-21 01:50:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:50:44,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474992952] [2022-07-21 01:50:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:50:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:50:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:50:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:50:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:50:44,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474992952] [2022-07-21 01:50:44,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474992952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:50:44,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:50:44,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:50:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485841194] [2022-07-21 01:50:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:50:44,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:50:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:50:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:50:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:50:44,935 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:50:44,961 INFO L93 Difference]: Finished difference Result 68 states and 110 transitions. [2022-07-21 01:50:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:50:44,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-21 01:50:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:50:44,968 INFO L225 Difference]: With dead ends: 68 [2022-07-21 01:50:44,968 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 01:50:44,971 INFO L412 NwaCegarLoop]: 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-07-21 01:50:44,973 INFO L413 NwaCegarLoop]: 47 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, 47 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-07-21 01:50:44,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:50:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 01:50:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-21 01:50:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-07-21 01:50:44,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 9 [2022-07-21 01:50:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:50:44,994 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-21 01:50:44,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-07-21 01:50:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:50:44,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:50:44,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:50:44,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:50:44,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:50:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:50:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1558271665, now seen corresponding path program 1 times [2022-07-21 01:50:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:50:44,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029985244] [2022-07-21 01:50:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:50:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:50:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:50:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:50:45,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:50:45,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029985244] [2022-07-21 01:50:45,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029985244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:50:45,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:50:45,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:50:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293267449] [2022-07-21 01:50:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:50:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:50:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:50:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:50:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:50:45,075 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-07-21 01:50:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:50:45,125 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-07-21 01:50:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:50:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-07-21 01:50:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:50:45,126 INFO L225 Difference]: With dead ends: 65 [2022-07-21 01:50:45,127 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 01:50:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:50:45,128 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:50:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 67 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:50:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 01:50:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-07-21 01:50:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-07-21 01:50:45,133 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 10 [2022-07-21 01:50:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:50:45,133 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-21 01:50:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-07-21 01:50:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-07-21 01:50:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:50:45,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:50:45,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:50:45,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:50:45,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:50:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:50:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash 893364878, now seen corresponding path program 1 times [2022-07-21 01:50:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:50:45,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397381180] [2022-07-21 01:50:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:50:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:50:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:50:45,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:50:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:50:45,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:50:45,234 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:50:45,235 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:50:45,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:50:45,241 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-21 01:50:45,243 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:50:45,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:50:45 BoogieIcfgContainer [2022-07-21 01:50:45,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:50:45,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:50:45,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:50:45,264 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:50:45,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:44" (3/4) ... [2022-07-21 01:50:45,266 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:50:45,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:50:45,267 INFO L158 Benchmark]: Toolchain (without parser) took 1260.28ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.8MB in the beginning and 36.1MB in the end (delta: 3.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,268 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:50:45,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.52ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 42.2MB in the end (delta: -2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.03ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,269 INFO L158 Benchmark]: Boogie Preprocessor took 44.80ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 38.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,269 INFO L158 Benchmark]: RCFGBuilder took 355.76ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 53.5MB in the end (delta: -15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,270 INFO L158 Benchmark]: TraceAbstraction took 514.14ms. Allocated memory is still 75.5MB. Free memory was 53.2MB in the beginning and 36.4MB in the end (delta: 16.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,270 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 36.1MB in the end (delta: 379.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:50:45,272 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.52ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 42.2MB in the end (delta: -2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.03ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.80ms. Allocated memory is still 60.8MB. Free memory was 39.7MB in the beginning and 38.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.76ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 37.9MB in the beginning and 53.5MB in the end (delta: -15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 514.14ms. Allocated memory is still 75.5MB. Free memory was 53.2MB in the beginning and 36.4MB in the end (delta: 16.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 36.1MB in the end (delta: 379.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 133]: 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 132, overapproximation of someUnaryDOUBLEoperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 129. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; [L34-L39] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L41-L46] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L48-L52] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L54-L56] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000] [L129] float x = 1.0f / 0.0f; [L130] CALL, EXPR atan_float(x) [L59] float w, s1, s2, z; [L60] __int32_t ix, hx, id; VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L63] ieee_float_shape_type gf_u; [L64] gf_u.value = (x) [L65] EXPR gf_u.word [L65] (hx) = gf_u.word [L67] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L68] COND FALSE !(ix >= 0x50800000) VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L76] COND TRUE ix < 0x3ee00000 VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L77] COND TRUE ix < 0x31000000 VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L78] COND TRUE huge_atan + x > one_atan [L79] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L130] RET, EXPR atan_float(x) [L130] float res = atan_float(x); [L132] COND TRUE res != pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] [L133] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 88 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 01:50:45,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_0621a.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 93ec260cb84d051ded8af47768b754d2a933d99ce3d516511a560eef2f740c5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:50:46,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:50:46,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:50:46,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:50:46,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:50:46,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:50:46,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:50:46,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:50:46,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:50:46,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:50:46,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:50:46,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:50:46,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:50:46,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:50:46,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:50:46,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:50:46,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:50:46,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:50:46,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:50:46,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:50:46,933 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:50:46,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:50:46,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:50:46,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:50:46,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:50:46,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:50:46,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:50:46,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:50:46,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:50:46,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:50:46,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:50:46,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:50:46,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:50:46,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:50:46,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:50:46,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:50:46,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:50:46,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:50:46,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:50:46,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:50:46,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:50:46,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:50:46,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:50:46,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:50:46,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:50:46,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:50:46,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:50:46,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:50:46,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:50:46,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:50:46,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:50:46,979 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:50:46,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:50:46,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:50:46,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:50:46,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:50:46,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:50:46,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:50:46,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:50:46,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:50:46,986 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:50:46,986 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:50:46,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:50:46,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:50:46,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:50:46,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:50:46,988 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 -> 93ec260cb84d051ded8af47768b754d2a933d99ce3d516511a560eef2f740c5a [2022-07-21 01:50:47,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:50:47,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:50:47,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:50:47,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:50:47,283 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:50:47,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0621a.c [2022-07-21 01:50:47,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb8c912f/05f55994ca8f48a6b09999468a9fdf9f/FLAGb7ef71059 [2022-07-21 01:50:47,710 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:50:47,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0621a.c [2022-07-21 01:50:47,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb8c912f/05f55994ca8f48a6b09999468a9fdf9f/FLAGb7ef71059 [2022-07-21 01:50:47,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb8c912f/05f55994ca8f48a6b09999468a9fdf9f [2022-07-21 01:50:47,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:50:47,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:50:47,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:50:47,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:50:47,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:50:47,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:50:47" (1/1) ... [2022-07-21 01:50:47,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5fa4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:47, skipping insertion in model container [2022-07-21 01:50:47,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:50:47" (1/1) ... [2022-07-21 01:50:47,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:50:47,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:50:47,952 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_0621a.c[3196,3209] [2022-07-21 01:50:47,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:50:47,972 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:50:48,007 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_0621a.c[3196,3209] [2022-07-21 01:50:48,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:50:48,031 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:50:48,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48 WrapperNode [2022-07-21 01:50:48,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:50:48,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:50:48,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:50:48,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:50:48,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,086 INFO L137 Inliner]: procedures = 22, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 175 [2022-07-21 01:50:48,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:50:48,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:50:48,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:50:48,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:50:48,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:50:48,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:50:48,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:50:48,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:50:48,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (1/1) ... [2022-07-21 01:50:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:50:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:50:48,161 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-07-21 01:50:48,163 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-07-21 01:50:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:50:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-21 01:50:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:50:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:50:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-21 01:50:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:50:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:50:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:50:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-21 01:50:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:50:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:50:48,268 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:50:48,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:50:58,611 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:50:58,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:50:58,615 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 01:50:58,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:58 BoogieIcfgContainer [2022-07-21 01:50:58,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:50:58,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:50:58,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:50:58,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:50:58,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:50:47" (1/3) ... [2022-07-21 01:50:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c21ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:50:58, skipping insertion in model container [2022-07-21 01:50:58,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:50:48" (2/3) ... [2022-07-21 01:50:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c21ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:50:58, skipping insertion in model container [2022-07-21 01:50:58,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:58" (3/3) ... [2022-07-21 01:50:58,621 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0621a.c [2022-07-21 01:50:58,629 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:50:58,630 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:50:58,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:50:58,659 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36e9ba8d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c37a804 [2022-07-21 01:50:58,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:50:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:50:58,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:50:58,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:50:58,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:50:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:50:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1906423550, now seen corresponding path program 1 times [2022-07-21 01:50:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:50:58,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409622875] [2022-07-21 01:50:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:50:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:50:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:50:58,679 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-07-21 01:50:58,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:50:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:50:59,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:50:59,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:50:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:50:59,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:50:59,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:50:59,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409622875] [2022-07-21 01:50:59,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409622875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:50:59,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:50:59,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:50:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107298811] [2022-07-21 01:50:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:50:59,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:50:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:50:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:50:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:50:59,350 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:50:59,359 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-07-21 01:50:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:50:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-21 01:50:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:50:59,365 INFO L225 Difference]: With dead ends: 62 [2022-07-21 01:50:59,366 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 01:50:59,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-07-21 01:50:59,371 INFO L413 NwaCegarLoop]: 42 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, 42 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-07-21 01:50:59,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:50:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 01:50:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 01:50:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-07-21 01:50:59,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2022-07-21 01:50:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:50:59,394 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-07-21 01:50:59,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:50:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-07-21 01:50:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:50:59,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:50:59,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:50:59,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:50:59,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:50:59,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:50:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:50:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1481927263, now seen corresponding path program 1 times [2022-07-21 01:50:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:50:59,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992974191] [2022-07-21 01:50:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:50:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:50:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:50:59,614 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-07-21 01:50:59,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:51:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:51:00,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:51:00,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:51:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:51:00,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:51:00,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:51:00,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992974191] [2022-07-21 01:51:00,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992974191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:51:00,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:51:00,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:51:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68489458] [2022-07-21 01:51:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:51:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:51:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:51:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:51:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:51:00,586 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-07-21 01:51:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:51:00,591 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-21 01:51:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:51:00,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-07-21 01:51:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:51:00,592 INFO L225 Difference]: With dead ends: 33 [2022-07-21 01:51:00,592 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 01:51:00,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:51:00,593 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:51:00,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-07-21 01:51:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 01:51:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 01:51:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:51:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-21 01:51:00,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 10 [2022-07-21 01:51:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:51:00,602 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-21 01:51:00,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-07-21 01:51:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-21 01:51:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:51:00,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:51:00,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:51:00,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:51:00,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:51:00,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:51:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:51:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1305404355, now seen corresponding path program 1 times [2022-07-21 01:51:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:51:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750375712] [2022-07-21 01:51:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:51:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:51:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:51:00,814 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-07-21 01:51:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:51:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:51:01,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:51:01,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:51:02,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:51:02,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:51:02,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-07-21 01:51:02,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 45 [2022-07-21 01:51:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:51:03,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:51:03,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:51:03,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750375712] [2022-07-21 01:51:03,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750375712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:51:03,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:51:03,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:51:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618524032] [2022-07-21 01:51:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:51:03,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:51:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:51:03,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:51:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:51:03,924 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07-21 01:51:07,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:09,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:10,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:13,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:15,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:18,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:51:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:51:18,001 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-21 01:51:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:51:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07-21 01:51:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:51:18,051 INFO L225 Difference]: With dead ends: 35 [2022-07-21 01:51:18,051 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:51:18,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:51:18,052 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:51:18,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 4 Unknown, 26 Unchecked, 13.2s Time] [2022-07-21 01:51:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:51:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-21 01:51:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:51:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-21 01:51:18,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 11 [2022-07-21 01:51:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:51:18,056 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-21 01:51:18,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07-21 01:51:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-21 01:51:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:51:18,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:51:18,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:51:18,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:51:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:51:18,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:51:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:51:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1305344773, now seen corresponding path program 1 times [2022-07-21 01:51:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:51:18,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341131687] [2022-07-21 01:51:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:51:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:51:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:51:18,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:51:18,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:51:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:51:18,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:51:18,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:51:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:51:19,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:51:19,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:51:19,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341131687] [2022-07-21 01:51:19,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341131687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:51:19,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:51:19,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:51:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837463944] [2022-07-21 01:51:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:51:19,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:51:19,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:51:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:51:19,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:51:19,109 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-07-21 01:51:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:51:19,112 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-07-21 01:51:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:51:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-07-21 01:51:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:51:19,113 INFO L225 Difference]: With dead ends: 37 [2022-07-21 01:51:19,113 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 01:51:19,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:51:19,114 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:51:19,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-07-21 01:51:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 01:51:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-21 01:51:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:51:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-21 01:51:19,118 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-07-21 01:51:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:51:19,118 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-21 01:51:19,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-07-21 01:51:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-21 01:51:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:51:19,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:51:19,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:51:19,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:51:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:51:19,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:51:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:51:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 540837948, now seen corresponding path program 1 times [2022-07-21 01:51:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:51:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29926091] [2022-07-21 01:51:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:51:19,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:51:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:51:19,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:51:19,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 01:51:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:51:19,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:51:19,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:51:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:51:20,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:51:20,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:51:20,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29926091] [2022-07-21 01:51:20,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29926091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:51:20,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:51:20,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:51:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209605076] [2022-07-21 01:51:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:51:20,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:51:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:51:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:51:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:51:20,225 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-21 01:51:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:51:20,227 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-07-21 01:51:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:51:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-21 01:51:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:51:20,227 INFO L225 Difference]: With dead ends: 27 [2022-07-21 01:51:20,227 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:51:20,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:51:20,230 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:51:20,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-07-21 01:51:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:51:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:51:20,231 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-07-21 01:51:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:51:20,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-07-21 01:51:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:51:20,231 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:51:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-21 01:51:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:51:20,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:51:20,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:51:20,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:51:20,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:51:20,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 76 101) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 91) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L118-2(line 118) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L895 garLoopResultBuilder]: At program point L118-3(lines 58 120) the Hoare annotation is: (and (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (_ bv4 32))))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (bvadd (bvneg (select |#valid| (_ bv5 32))) (_ bv1 1)) (_ bv0 1)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (exists ((v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 75497894159.0 1000000000000000000.0)))) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 15707962513.0 10000000000.0)))) (= |ULTIMATE.start_atan_float_#res#1| (fp.add roundNearestTiesToEven .cse3 .cse2))))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 80) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L77-2(lines 77 80) no Hoare annotation was computed. [2022-07-21 01:51:21,039 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 70) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 79) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 62 66) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L895 garLoopResultBuilder]: At program point L62-2(lines 62 66) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (select |#valid| (_ bv5 32)) (_ bv1 1)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (select |#valid| (_ bv4 32)) (_ bv1 1)) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L62-3(lines 62 66) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: false [2022-07-21 01:51:21,040 INFO L902 garLoopResultBuilder]: At program point L137(lines 122 138) the Hoare annotation is: true [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 74) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L895 garLoopResultBuilder]: At program point L31(lines 19 32) the Hoare annotation is: false [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 135) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-07-21 01:51:21,040 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 30) no Hoare annotation was computed. [2022-07-21 01:51:21,041 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 32) no Hoare annotation was computed. [2022-07-21 01:51:21,041 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 30) no Hoare annotation was computed. [2022-07-21 01:51:21,041 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 100) no Hoare annotation was computed. [2022-07-21 01:51:21,041 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 101) no Hoare annotation was computed. [2022-07-21 01:51:21,041 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 75) no Hoare annotation was computed. [2022-07-21 01:51:21,043 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-21 01:51:21,044 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:51:21,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,055 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,057 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,059 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,059 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:51:21 BoogieIcfgContainer [2022-07-21 01:51:21,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:51:21,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:51:21,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:51:21,061 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:51:21,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:50:58" (3/4) ... [2022-07-21 01:51:21,063 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 01:51:21,071 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-21 01:51:21,071 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-21 01:51:21,071 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 01:51:21,071 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 01:51:21,085 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && \valid[5bv32] == 1bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-21 01:51:21,086 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((atanlo_atan == 5bv32 && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && (\exists v_arrayElimCell_4 : bv32, v_arrayElimCell_3 : bv32 :: (~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 75497894159/1000000000000000000)) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 15707962513/10000000000))) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]), ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0])))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-21 01:51:21,098 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 01:51:21,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:51:21,099 INFO L158 Benchmark]: Toolchain (without parser) took 33369.02ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.4MB in the beginning and 39.6MB in the end (delta: -8.3MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,099 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:51:21,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.53ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 48.8MB in the end (delta: -17.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.59ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,100 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 44.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,100 INFO L158 Benchmark]: RCFGBuilder took 10492.25ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 40.9MB in the end (delta: 3.3MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,100 INFO L158 Benchmark]: TraceAbstraction took 22443.16ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 43.1MB in the end (delta: -2.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,101 INFO L158 Benchmark]: Witness Printer took 37.73ms. Allocated memory is still 69.2MB. Free memory was 43.1MB in the beginning and 39.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:51:21,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.53ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 48.8MB in the end (delta: -17.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.59ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 44.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 10492.25ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 40.9MB in the end (delta: 3.3MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22443.16ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 43.1MB in the end (delta: -2.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 37.73ms. Allocated memory is still 69.2MB. Free memory was 43.1MB in the beginning and 39.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,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[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,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[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,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[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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: 133]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 78 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 134 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 242 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 48 ConstructedInterpolants, 17 QuantifiedInterpolants, 933 SizeOfPredicates, 29 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-07-21 01:51:21,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((atanlo_atan == 5bv32 && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && (\exists v_arrayElimCell_4 : bv32, v_arrayElimCell_3 : bv32 :: (~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 75497894159/1000000000000000000)) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 15707962513/10000000000))) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]), ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0])))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 62]: Loop Invariant [2022-07-21 01:51:21,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:51:21,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-21 01:51:21,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && \valid[5bv32] == 1bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-21 01:51:21,260 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