./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0480.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0480.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 63d3574782fa6454b0d1694c2d11597178e5561b6615edd1b2b746975245a1dc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:03,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:03,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:03,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:03,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:03,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:03,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:03,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:03,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:03,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:03,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:03,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:03,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:03,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:03,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:03,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:03,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:03,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:03,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:03,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:03,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:03,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:03,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:03,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:03,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:03,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:03,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:03,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:03,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:03,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:03,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:03,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:03,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:03,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:03,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:03,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:03,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:03,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:03,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:03,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:03,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:03,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:39:03,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:03,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:03,232 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:03,232 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:03,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:03,233 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:03,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:03,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:03,234 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:03,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:03,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:03,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:39:03,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:03,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:03,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:03,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:03,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:03,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:03,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:03,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:03,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:03,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:03,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:03,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:39:03,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:39:03,239 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:03,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:03,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:03,239 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 -> 63d3574782fa6454b0d1694c2d11597178e5561b6615edd1b2b746975245a1dc [2022-02-20 16:39:03,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:03,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:03,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:03,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:03,473 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:03,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0480.c [2022-02-20 16:39:03,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801405768/7133fe812cf94638a8e8444923d99f2f/FLAGd64253df2 [2022-02-20 16:39:03,891 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:03,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0480.c [2022-02-20 16:39:03,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801405768/7133fe812cf94638a8e8444923d99f2f/FLAGd64253df2 [2022-02-20 16:39:03,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801405768/7133fe812cf94638a8e8444923d99f2f [2022-02-20 16:39:03,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:03,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:03,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:03,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:03,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:03,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:03" (1/1) ... [2022-02-20 16:39:03,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e91c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:03, skipping insertion in model container [2022-02-20 16:39:03,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:03" (1/1) ... [2022-02-20 16:39:03,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:03,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:04,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0480.c[4489,4502] [2022-02-20 16:39:04,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:04,174 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:04,217 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_0480.c[4489,4502] [2022-02-20 16:39:04,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:04,235 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:04,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04 WrapperNode [2022-02-20 16:39:04,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:04,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:04,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:04,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:04,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,284 INFO L137 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 160 [2022-02-20 16:39:04,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:04,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:04,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:04,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:04,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:04,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:04,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:04,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:04,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:04,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:39:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:39:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:39:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:39:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:39:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:39:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:39:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:39:04,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:39:04,483 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:04,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:04,907 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:04,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:04,912 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:39:04,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04 BoogieIcfgContainer [2022-02-20 16:39:04,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:04,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:04,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:04,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:04,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:03" (1/3) ... [2022-02-20 16:39:04,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5ad11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:04, skipping insertion in model container [2022-02-20 16:39:04,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (2/3) ... [2022-02-20 16:39:04,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5ad11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:04, skipping insertion in model container [2022-02-20 16:39:04,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04" (3/3) ... [2022-02-20 16:39:04,919 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0480.c [2022-02-20 16:39:04,922 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:04,923 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:04,955 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:04,959 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:39:04,960 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 64 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:04,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:04,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:04,976 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -898785153, now seen corresponding path program 1 times [2022-02-20 16:39:04,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:04,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064726486] [2022-02-20 16:39:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:05,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {71#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_acos~0 := 1.0;~pi~0 := 3.1415925026;~pio2_hi_acos~0 := 1.5707962513;~pio2_lo_acos~0 := 7.5497894159E-8;~pS0_acos~0 := 0.16666667163;~pS1_acos~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_acos~0 := 0.20121252537;~pS3_acos~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_acos~0 := 7.9153501429E-4;~pS5_acos~0 := 3.4793309169E-5;~qS1_acos~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_acos~0 := 2.0209457874;~qS3_acos~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_acos~0 := 0.077038154006; {71#true} is VALID [2022-02-20 16:39:05,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {71#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 1.0;assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem9#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret11#1, __ieee754_acosf_#t~ret12#1, __ieee754_acosf_#t~mem13#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem14#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1, __ieee754_acosf_#t~nondet10#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {71#true} is VALID [2022-02-20 16:39:05,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#true} assume !true; {72#false} is VALID [2022-02-20 16:39:05,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#false} assume 0 == __ieee754_acosf_~hx~1#1;__ieee754_acosf_~ix~1#1 := 0; {72#false} is VALID [2022-02-20 16:39:05,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#false} assume 1065353216 == __ieee754_acosf_~ix~1#1; {72#false} is VALID [2022-02-20 16:39:05,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {72#false} assume __ieee754_acosf_~hx~1#1 > 0;__ieee754_acosf_#res#1 := 0.0; {72#false} is VALID [2022-02-20 16:39:05,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {72#false} main_#t~ret16#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {72#false} is VALID [2022-02-20 16:39:05,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {72#false} assume !main_#t~short18#1; {72#false} is VALID [2022-02-20 16:39:05,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {72#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {72#false} is VALID [2022-02-20 16:39:05,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {72#false} assume !false; {72#false} is VALID [2022-02-20 16:39:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:05,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:05,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064726486] [2022-02-20 16:39:05,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064726486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:05,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:05,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:05,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167598453] [2022-02-20 16:39:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:05,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:05,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:05,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:05,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:05,124 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 64 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,199 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2022-02-20 16:39:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2022-02-20 16:39:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2022-02-20 16:39:05,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 226 transitions. [2022-02-20 16:39:05,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,418 INFO L225 Difference]: With dead ends: 134 [2022-02-20 16:39:05,418 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 16:39:05,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:05,428 INFO L933 BasicCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:05,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 16:39:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 16:39:05,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:05,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,452 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,453 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,457 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-02-20 16:39:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-02-20 16:39:05,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 16:39:05,458 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 16:39:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,462 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-02-20 16:39:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-02-20 16:39:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:05,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-02-20 16:39:05,466 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 10 [2022-02-20 16:39:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:05,466 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-02-20 16:39:05,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-02-20 16:39:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:05,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:05,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:05,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:39:05,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1060874946, now seen corresponding path program 1 times [2022-02-20 16:39:05,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:05,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422081847] [2022-02-20 16:39:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:05,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_acos~0 := 1.0;~pi~0 := 3.1415925026;~pio2_hi_acos~0 := 1.5707962513;~pio2_lo_acos~0 := 7.5497894159E-8;~pS0_acos~0 := 0.16666667163;~pS1_acos~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_acos~0 := 0.20121252537;~pS3_acos~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_acos~0 := 7.9153501429E-4;~pS5_acos~0 := 3.4793309169E-5;~qS1_acos~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_acos~0 := 2.0209457874;~qS3_acos~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_acos~0 := 0.077038154006; {442#true} is VALID [2022-02-20 16:39:05,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 1.0;assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem9#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret11#1, __ieee754_acosf_#t~ret12#1, __ieee754_acosf_#t~mem13#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem14#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1, __ieee754_acosf_#t~nondet10#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {442#true} is VALID [2022-02-20 16:39:05,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4);call __ieee754_acosf_#t~mem9#1 := read~int(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4);__ieee754_acosf_~hx~1#1 := (if __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 else __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_acosf_#t~mem9#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {442#true} is VALID [2022-02-20 16:39:05,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {442#true} goto; {442#true} is VALID [2022-02-20 16:39:05,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#true} assume 0 == __ieee754_acosf_~hx~1#1;__ieee754_acosf_~ix~1#1 := 0; {444#(= |ULTIMATE.start___ieee754_acosf_~ix~1#1| 0)} is VALID [2022-02-20 16:39:05,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(= |ULTIMATE.start___ieee754_acosf_~ix~1#1| 0)} assume 1065353216 == __ieee754_acosf_~ix~1#1; {443#false} is VALID [2022-02-20 16:39:05,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#false} assume __ieee754_acosf_~hx~1#1 > 0;__ieee754_acosf_#res#1 := 0.0; {443#false} is VALID [2022-02-20 16:39:05,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {443#false} main_#t~ret16#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {443#false} is VALID [2022-02-20 16:39:05,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {443#false} assume !main_#t~short18#1; {443#false} is VALID [2022-02-20 16:39:05,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {443#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {443#false} is VALID [2022-02-20 16:39:05,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-02-20 16:39:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:05,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:05,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422081847] [2022-02-20 16:39:05,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422081847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:05,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:05,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:39:05,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888705934] [2022-02-20 16:39:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:39:05,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:05,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:39:05,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:05,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:39:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:05,526 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,627 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2022-02-20 16:39:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:39:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:39:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-20 16:39:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-20 16:39:05,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 175 transitions. [2022-02-20 16:39:05,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,751 INFO L225 Difference]: With dead ends: 131 [2022-02-20 16:39:05,751 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 16:39:05,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:05,752 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:05,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 16:39:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-02-20 16:39:05,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:05,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,757 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,758 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,760 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-02-20 16:39:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-02-20 16:39:05,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 16:39:05,762 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 16:39:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,767 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-02-20 16:39:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-02-20 16:39:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:05,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-02-20 16:39:05,774 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 11 [2022-02-20 16:39:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:05,775 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-02-20 16:39:05,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-02-20 16:39:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:39:05,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:05,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:05,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:39:05,777 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -951685113, now seen corresponding path program 1 times [2022-02-20 16:39:05,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:05,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493298912] [2022-02-20 16:39:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:05,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:39:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:05,832 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:39:05,832 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:39:05,833 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:39:05,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:39:05,836 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:39:05,838 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:39:05,858 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: __ieee754_sqrtfENTRY has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L95-2 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L95-2 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L95-3 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L95-3 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L100-7 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L100-7 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: __ieee754_sqrtfFINAL has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L100-5 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L100-5 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:39:05,867 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L164-2 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L164-2 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L183-2 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L183-2 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:39:05,868 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2022-02-20 16:39:05,869 WARN L170 areAnnotationChecker]: L164-3 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L143-2 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:39:05,870 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:39:05,871 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:39:05,872 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:39:05,873 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:39:05,873 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:39:05,873 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:39:05,873 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:39:05,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:39:05 BoogieIcfgContainer [2022-02-20 16:39:05,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:39:05,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:39:05,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:39:05,875 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:39:05,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04" (3/4) ... [2022-02-20 16:39:05,877 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:39:05,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:39:05,878 INFO L158 Benchmark]: Toolchain (without parser) took 1963.17ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 68.2MB in the beginning and 66.9MB in the end (delta: 1.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,878 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:05,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.67ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 70.1MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.87ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 67.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,879 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,880 INFO L158 Benchmark]: RCFGBuilder took 592.93ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 65.2MB in the beginning and 112.7MB in the end (delta: -47.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,880 INFO L158 Benchmark]: TraceAbstraction took 958.88ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 66.9MB in the end (delta: 45.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,880 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:05,882 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.67ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 70.1MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.87ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 67.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.93ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 65.2MB in the beginning and 112.7MB in the end (delta: -47.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 958.88ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 66.9MB in the end (delta: 45.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 184]: 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 183, overapproximation of someUnaryDOUBLEoperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L83-L90] static const float one_acos = 1.0000000000e+00, pi = 3.1415925026e+00, pio2_hi_acos = 1.5707962513e+00, pio2_lo_acos = 7.5497894159e-08, pS0_acos = 1.6666667163e-01, pS1_acos = -3.2556581497e-01, pS2_acos = 2.0121252537e-01, pS3_acos = -4.0055535734e-02, pS4_acos = 7.9153501429e-04, pS5_acos = 3.4793309169e-05, qS1_acos = -2.4033949375e+00, qS2_acos = 2.0209457874e+00, qS3_acos = -6.8828397989e-01, qS4_acos = 7.7038154006e-02; VAL [one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L179] float x = 1.0f; [L180] CALL, EXPR __ieee754_acosf(x) [L93] float z, p, q, r, w, s, c, df; [L94] __int32_t hx, ix; VAL [\old(x)=1, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L96] ieee_float_shape_type gf_u; [L97] gf_u.value = (x) [L98] EXPR gf_u.word [L98] (hx) = gf_u.word [L100] ix = hx & 0x7fffffff VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L101] COND FALSE !(ix == 0x3f800000) VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L106] COND FALSE !(ix > 0x3f800000) VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L109] COND TRUE ix < 0x3f000000 VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L110] COND TRUE ix <= 0x23000000 [L111] return pio2_hi_acos + pio2_lo_acos; VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L180] RET, EXPR __ieee754_acosf(x) [L180] float res = __ieee754_acosf(x); [L183] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, res=4294967297, res == 0.0f && __signbit_float(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000, x=1] [L183] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L184] reach_error() VAL [one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, res=4294967297, tiny_sqrt=1/1000000000000000000000000000000, x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 175 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:39:05,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0480.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 63d3574782fa6454b0d1694c2d11597178e5561b6615edd1b2b746975245a1dc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:07,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:07,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:07,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:07,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:07,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:07,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:07,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:07,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:07,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:07,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:07,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:07,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:07,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:07,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:07,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:07,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:07,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:07,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:07,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:07,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:07,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:07,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:07,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:07,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:07,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:07,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:07,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:07,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:07,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:07,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:07,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:07,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:07,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:07,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:07,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:07,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:07,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:07,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:07,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:07,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:07,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:39:07,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:07,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:07,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:07,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:07,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:07,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:07,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:07,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:07,710 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:07,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:07,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:07,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:07,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:07,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:07,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:07,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:07,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:07,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:07,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:07,721 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:39:07,721 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:39:07,722 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:07,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:07,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:07,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:39:07,722 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 -> 63d3574782fa6454b0d1694c2d11597178e5561b6615edd1b2b746975245a1dc [2022-02-20 16:39:07,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:07,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:07,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:07,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:07,989 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:07,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0480.c [2022-02-20 16:39:08,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26d1655/403e3bcf7cfa4fe38d8ba453cad73f48/FLAG87dd87151 [2022-02-20 16:39:08,432 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:08,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0480.c [2022-02-20 16:39:08,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26d1655/403e3bcf7cfa4fe38d8ba453cad73f48/FLAG87dd87151 [2022-02-20 16:39:08,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26d1655/403e3bcf7cfa4fe38d8ba453cad73f48 [2022-02-20 16:39:08,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:08,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:08,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:08,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:08,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:08,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e229461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08, skipping insertion in model container [2022-02-20 16:39:08,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:08,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:08,659 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_0480.c[4489,4502] [2022-02-20 16:39:08,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:08,679 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:08,714 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_0480.c[4489,4502] [2022-02-20 16:39:08,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:08,727 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:08,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08 WrapperNode [2022-02-20 16:39:08,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:08,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:08,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:08,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:08,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,774 INFO L137 Inliner]: procedures = 21, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2022-02-20 16:39:08,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:08,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:08,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:08,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:08,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:08,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:08,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:08,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:08,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:08,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:08,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:39:08,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:39:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:08,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:39:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:39:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:39:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:39:08,963 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:08,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:19,239 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:19,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:19,244 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:39:19,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:19 BoogieIcfgContainer [2022-02-20 16:39:19,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:19,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:19,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:19,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:19,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:08" (1/3) ... [2022-02-20 16:39:19,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b8fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:19, skipping insertion in model container [2022-02-20 16:39:19,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08" (2/3) ... [2022-02-20 16:39:19,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b8fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:19, skipping insertion in model container [2022-02-20 16:39:19,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:19" (3/3) ... [2022-02-20 16:39:19,249 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0480.c [2022-02-20 16:39:19,253 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:19,253 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:19,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:19,286 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:39:19,287 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:19,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:19,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:19,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1029505661, now seen corresponding path program 1 times [2022-02-20 16:39:19,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:19,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128680525] [2022-02-20 16:39:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:19,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:19,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:39:19,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:39:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:19,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:39:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:19,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:19,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {61#true} is VALID [2022-02-20 16:39:19,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret13#1, main_#t~ret14#1, main_#t~short15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {61#true} is VALID [2022-02-20 16:39:19,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#true} assume !true; {62#false} is VALID [2022-02-20 16:39:19,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#false} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {62#false} is VALID [2022-02-20 16:39:19,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#false} assume 1065353216bv32 == __ieee754_acosf_~ix~1#1; {62#false} is VALID [2022-02-20 16:39:19,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#false} assume ~bvsgt32(__ieee754_acosf_~hx~1#1, 0bv32);__ieee754_acosf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {62#false} is VALID [2022-02-20 16:39:19,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#false} main_#t~ret13#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_#t~short15#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {62#false} is VALID [2022-02-20 16:39:19,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#false} assume !main_#t~short15#1; {62#false} is VALID [2022-02-20 16:39:19,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#false} assume !main_#t~short15#1;havoc main_#t~ret14#1;havoc main_#t~short15#1; {62#false} is VALID [2022-02-20 16:39:19,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#false} assume !false; {62#false} is VALID [2022-02-20 16:39:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:19,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:19,882 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:19,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128680525] [2022-02-20 16:39:19,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128680525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:19,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:19,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:19,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191081292] [2022-02-20 16:39:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:19,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:19,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:19,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:19,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:19,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:19,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:19,923 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 54 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:30,246 INFO L93 Difference]: Finished difference Result 114 states and 182 transitions. [2022-02-20 16:39:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2022-02-20 16:39:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2022-02-20 16:39:30,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 182 transitions. [2022-02-20 16:39:35,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:35,529 INFO L225 Difference]: With dead ends: 114 [2022-02-20 16:39:35,529 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:39:35,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:35,534 INFO L933 BasicCegarLoop]: 76 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, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:35,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:39:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 16:39:35,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:35,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,557 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,559 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:35,563 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-02-20 16:39:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2022-02-20 16:39:35,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:35,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:35,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 55 states. [2022-02-20 16:39:35,565 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 55 states. [2022-02-20 16:39:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:35,569 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-02-20 16:39:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2022-02-20 16:39:35,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:35,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:35,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:35,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2022-02-20 16:39:35,578 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 10 [2022-02-20 16:39:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:35,578 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2022-02-20 16:39:35,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2022-02-20 16:39:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:35,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:35,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:35,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:39:35,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:39:35,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1305801536, now seen corresponding path program 1 times [2022-02-20 16:39:35,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:35,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655292401] [2022-02-20 16:39:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:35,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:39:35,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:39:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:36,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:39:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:36,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:36,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {409#true} is VALID [2022-02-20 16:39:36,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {409#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret13#1, main_#t~ret14#1, main_#t~short15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {409#true} is VALID [2022-02-20 16:39:36,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {409#true} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);call __ieee754_acosf_#t~mem7#1 := read~intINTTYPE4(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);__ieee754_acosf_~hx~1#1 := __ieee754_acosf_#t~mem7#1;havoc __ieee754_acosf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {409#true} is VALID [2022-02-20 16:39:36,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {409#true} goto; {409#true} is VALID [2022-02-20 16:39:36,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {409#true} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {409#true} is VALID [2022-02-20 16:39:36,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#true} assume 1065353216bv32 == __ieee754_acosf_~ix~1#1; {409#true} is VALID [2022-02-20 16:39:36,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {409#true} assume ~bvsgt32(__ieee754_acosf_~hx~1#1, 0bv32);__ieee754_acosf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {432#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___ieee754_acosf_#res#1|))} is VALID [2022-02-20 16:39:36,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {432#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___ieee754_acosf_#res#1|))} main_#t~ret13#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_#t~short15#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {436#|ULTIMATE.start_main_#t~short15#1|} is VALID [2022-02-20 16:39:36,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#|ULTIMATE.start_main_#t~short15#1|} assume !main_#t~short15#1; {410#false} is VALID [2022-02-20 16:39:36,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#false} assume !main_#t~short15#1;havoc main_#t~ret14#1;havoc main_#t~short15#1; {410#false} is VALID [2022-02-20 16:39:36,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#false} assume !false; {410#false} is VALID [2022-02-20 16:39:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:36,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:36,582 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:36,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655292401] [2022-02-20 16:39:36,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655292401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:36,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:36,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:39:36,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114211370] [2022-02-20 16:39:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:36,586 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-02-20 16:39:36,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:36,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 16:39:36,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:36,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:39:36,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:39:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:39:36,613 INFO L87 Difference]: Start difference. First operand 55 states and 73 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-02-20 16:40:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:03,681 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-02-20 16:40:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:40:03,682 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-02-20 16:40:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:40:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 16:40:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:40:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 16:40:03,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-02-20 16:40:06,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:06,467 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:40:06,467 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:40:06,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:40:06,468 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:06,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2022-02-20 16:40:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:40:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 16:40:06,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:06,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:06,473 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:06,473 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:06,476 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-02-20 16:40:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:40:06,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:06,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:06,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:40:06,477 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:40:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:06,485 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-02-20 16:40:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:40:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:06,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:06,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:06,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2022-02-20 16:40:06,488 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 11 [2022-02-20 16:40:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:06,488 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2022-02-20 16:40:06,488 INFO L471 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-02-20 16:40:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:40:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:06,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:06,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:06,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:40:06,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:40:06,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1303954494, now seen corresponding path program 1 times [2022-02-20 16:40:06,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:06,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256841139] [2022-02-20 16:40:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:06,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:06,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:40:06,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:40:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:07,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:40:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:07,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:07,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {702#true} is VALID [2022-02-20 16:40:07,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret13#1, main_#t~ret14#1, main_#t~short15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~to_fp~FLOAT(currentRoundingMode, 1.0);assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {710#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_acosf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:40:07,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_acosf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);call __ieee754_acosf_#t~mem7#1 := read~intINTTYPE4(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);__ieee754_acosf_~hx~1#1 := __ieee754_acosf_#t~mem7#1;havoc __ieee754_acosf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:40:07,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} goto; {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:40:07,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:40:07,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume 1065353216bv32 == __ieee754_acosf_~ix~1#1; {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} is VALID [2022-02-20 16:40:07,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0)))} assume !~bvsgt32(__ieee754_acosf_~hx~1#1, 0bv32);__ieee754_acosf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~pi~0, ~fp.mul~FLOAT(currentRoundingMode, ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~pio2_lo_acos~0)); {703#false} is VALID [2022-02-20 16:40:07,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {703#false} main_#t~ret13#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_#t~short15#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {703#false} is VALID [2022-02-20 16:40:07,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {703#false} assume !main_#t~short15#1; {703#false} is VALID [2022-02-20 16:40:07,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {703#false} assume !main_#t~short15#1;havoc main_#t~ret14#1;havoc main_#t~short15#1; {703#false} is VALID [2022-02-20 16:40:07,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-02-20 16:40:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:07,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:07,546 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:07,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256841139] [2022-02-20 16:40:07,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256841139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:07,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:07,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:40:07,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350033132] [2022-02-20 16:40:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:07,548 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-02-20 16:40:07,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:07,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 16:40:07,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:07,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:40:07,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:40:07,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:40:07,600 INFO L87 Difference]: Start difference. First operand 57 states and 75 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)