./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0910a.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_0910a.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 1985c142f4bad82ade144c3cf2f9b0ec416a6e8e883d7c5dd74ff953a2b83fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:44:19,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:44:19,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:44:19,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:44:19,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:44:19,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:44:19,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:44:19,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:44:19,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:44:19,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:44:19,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:44:19,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:44:19,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:44:19,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:44:19,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:44:19,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:44:19,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:44:19,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:44:19,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:44:19,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:44:19,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:44:19,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:44:19,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:44:19,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:44:19,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:44:19,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:44:19,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:44:19,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:44:19,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:44:19,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:44:19,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:44:19,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:44:19,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:44:19,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:44:19,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:44:19,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:44:19,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:44:19,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:44:19,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:44:19,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:44:19,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:44:19,621 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:44:19,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:44:19,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:44:19,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:44:19,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:44:19,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:44:19,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:44:19,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:44:19,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:44:19,638 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:44:19,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:44:19,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:44:19,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:44:19,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:44:19,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:44:19,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:44:19,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:44:19,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:44:19,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:44:19,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:44:19,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:44:19,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:44:19,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:44:19,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:44:19,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:44:19,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:44:19,642 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:44:19,642 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:44:19,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:44:19,642 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 -> 1985c142f4bad82ade144c3cf2f9b0ec416a6e8e883d7c5dd74ff953a2b83fc0 [2022-02-20 16:44:19,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:44:19,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:44:19,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:44:19,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:44:19,829 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:44:19,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0910a.c [2022-02-20 16:44:19,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c3da7b5/7f8b6af138c04eceb60748d3f5b65f74/FLAGd17aec06b [2022-02-20 16:44:20,301 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:44:20,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0910a.c [2022-02-20 16:44:20,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c3da7b5/7f8b6af138c04eceb60748d3f5b65f74/FLAGd17aec06b [2022-02-20 16:44:20,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c3da7b5/7f8b6af138c04eceb60748d3f5b65f74 [2022-02-20 16:44:20,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:44:20,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:44:20,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:44:20,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:44:20,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:44:20,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa84d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20, skipping insertion in model container [2022-02-20 16:44:20,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:44:20,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:44:20,517 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_0910a.c[3092,3105] [2022-02-20 16:44:20,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:44:20,525 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:44:20,565 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_0910a.c[3092,3105] [2022-02-20 16:44:20,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:44:20,592 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:44:20,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20 WrapperNode [2022-02-20 16:44:20,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:44:20,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:44:20,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:44:20,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:44:20,599 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:44:20" (1/1) ... [2022-02-20 16:44:20,607 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:44:20" (1/1) ... [2022-02-20 16:44:20,637 INFO L137 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 165 [2022-02-20 16:44:20,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:44:20,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:44:20,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:44:20,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:44:20,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:44:20,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:44:20,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:44:20,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:44:20,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (1/1) ... [2022-02-20 16:44:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:44:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:44:20,697 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:44:20,715 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:44:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:44:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:44:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:44:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:44:20,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:44:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:44:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:44:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:44:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:44:20,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:44:20,813 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:44:20,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:44:21,118 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:44:21,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:44:21,124 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:44:21,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:44:21 BoogieIcfgContainer [2022-02-20 16:44:21,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:44:21,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:44:21,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:44:21,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:44:21,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:44:20" (1/3) ... [2022-02-20 16:44:21,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5350b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:44:21, skipping insertion in model container [2022-02-20 16:44:21,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:20" (2/3) ... [2022-02-20 16:44:21,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5350b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:44:21, skipping insertion in model container [2022-02-20 16:44:21,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:44:21" (3/3) ... [2022-02-20 16:44:21,132 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0910a.c [2022-02-20 16:44:21,136 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:44:21,136 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:44:21,201 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:44:21,207 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:44:21,208 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:44:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:44:21,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:21,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:21,227 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash 412524763, now seen corresponding path program 1 times [2022-02-20 16:44:21,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:44:21,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868092620] [2022-02-20 16:44:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:44:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:21,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~ln2_hi_log~0 := 0.69313812256;~ln2_lo_log~0 := 9.0580006145E-6;~two25_log~0 := 3.3554432E7;~Lg1_log~0 := 0.66666668653;~Lg2_log~0 := 0.40000000596;~Lg3_log~0 := 0.28571429849;~Lg4_log~0 := 0.22222198546;~Lg5_log~0 := 0.1818357259;~Lg6_log~0 := 0.15313838422;~Lg7_log~0 := 0.1479819864;~zero_log~0 := 0.0; {40#true} is VALID [2022-02-20 16:44:21,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.0;assume { :begin_inline___ieee754_logf } true;__ieee754_logf_#in~x#1 := main_~x~0#1;havoc __ieee754_logf_#res#1;havoc __ieee754_logf_#t~mem5#1, __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset, __ieee754_logf_#t~mem6#1, __ieee754_logf_~#gf_u~2#1.base, __ieee754_logf_~#gf_u~2#1.offset, __ieee754_logf_#t~mem8#1, __ieee754_logf_~#sf_u~0#1.base, __ieee754_logf_~#sf_u~0#1.offset, __ieee754_logf_~x#1, __ieee754_logf_~hfsq~0#1, __ieee754_logf_~f~0#1, __ieee754_logf_~s~0#1, __ieee754_logf_~z~0#1, __ieee754_logf_~R~0#1, __ieee754_logf_~w~0#1, __ieee754_logf_~t1~0#1, __ieee754_logf_~t2~0#1, __ieee754_logf_~dk~0#1, __ieee754_logf_~k~0#1, __ieee754_logf_~ix~1#1, __ieee754_logf_~i~0#1, __ieee754_logf_~j~0#1, __ieee754_logf_#t~nondet7#1;__ieee754_logf_~x#1 := __ieee754_logf_#in~x#1;havoc __ieee754_logf_~hfsq~0#1;havoc __ieee754_logf_~f~0#1;havoc __ieee754_logf_~s~0#1;havoc __ieee754_logf_~z~0#1;havoc __ieee754_logf_~R~0#1;havoc __ieee754_logf_~w~0#1;havoc __ieee754_logf_~t1~0#1;havoc __ieee754_logf_~t2~0#1;havoc __ieee754_logf_~dk~0#1;havoc __ieee754_logf_~k~0#1;havoc __ieee754_logf_~ix~1#1;havoc __ieee754_logf_~i~0#1;havoc __ieee754_logf_~j~0#1; {40#true} is VALID [2022-02-20 16:44:21,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:44:21,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#false} __ieee754_logf_~k~0#1 := 0; {41#false} is VALID [2022-02-20 16:44:21,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#false} assume 0 == (if 0 == __ieee754_logf_~ix~1#1 then 0 else (if 1 == __ieee754_logf_~ix~1#1 then 1 else ~bitwiseAnd(__ieee754_logf_~ix~1#1, 2147483647)));__ieee754_logf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(~two25_log~0), ~zero_log~0); {41#false} is VALID [2022-02-20 16:44:21,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#false} main_#t~ret9#1 := __ieee754_logf_#res#1;assume { :end_inline___ieee754_logf } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem4#1, isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {41#false} is VALID [2022-02-20 16:44:21,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-02-20 16:44:21,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {41#false} is VALID [2022-02-20 16:44:21,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#false} main_#t~ret10#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {41#false} is VALID [2022-02-20 16:44:21,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {41#false} is VALID [2022-02-20 16:44:21,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:44:21,379 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:44:21,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:44:21,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868092620] [2022-02-20 16:44:21,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868092620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:21,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:21,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:44:21,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465405269] [2022-02-20 16:44:21,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:44:21,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:21,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,404 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:44:21,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:44:21,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:44:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:44:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:44:21,442 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:21,514 INFO L93 Difference]: Finished difference Result 72 states and 118 transitions. [2022-02-20 16:44:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:44:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:44:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2022-02-20 16:44:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2022-02-20 16:44:21,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2022-02-20 16:44:21,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:21,650 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:44:21,656 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:44:21,659 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:44:21,662 INFO L933 BasicCegarLoop]: 49 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, 49 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:44:21,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:44:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:44:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:44:21,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:21,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:44:21,686 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:44:21,687 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:44:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:21,689 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-20 16:44:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-02-20 16:44:21,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:21,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:21,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:44:21,691 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:44:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:21,695 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-20 16:44:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-02-20 16:44:21,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:21,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:21,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:21,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:44:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-02-20 16:44:21,703 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 11 [2022-02-20 16:44:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:21,703 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-20 16:44:21,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-02-20 16:44:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:44:21,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:21,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:21,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:44:21,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1735961236, now seen corresponding path program 1 times [2022-02-20 16:44:21,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:44:21,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140661950] [2022-02-20 16:44:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:44:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:44:21,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:44:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:44:21,847 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:44:21,848 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:44:21,849 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:44:21,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:44:21,853 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:44:21,855 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:44:21,890 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:44:21,890 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:44:21,890 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:44:21,891 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:44:21,892 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2022-02-20 16:44:21,893 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:44:21,894 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:44:21,895 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:44:21,896 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:44:21,897 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:44:21,897 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:44:21,897 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:44:21,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:44:21 BoogieIcfgContainer [2022-02-20 16:44:21,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:44:21,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:44:21,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:44:21,898 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:44:21,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:44:21" (3/4) ... [2022-02-20 16:44:21,901 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:44:21,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:44:21,902 INFO L158 Benchmark]: Toolchain (without parser) took 1575.04ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 72.0MB in the beginning and 76.6MB in the end (delta: -4.6MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,902 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:44:21,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.88ms. Allocated memory is still 102.8MB. Free memory was 71.8MB in the beginning and 76.1MB in the end (delta: -4.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.37ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,904 INFO L158 Benchmark]: Boogie Preprocessor took 35.65ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,905 INFO L158 Benchmark]: RCFGBuilder took 451.47ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 53.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,905 INFO L158 Benchmark]: TraceAbstraction took 770.91ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 52.7MB in the beginning and 77.3MB in the end (delta: -24.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-02-20 16:44:21,905 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:44:21,907 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.18ms. Allocated memory is still 102.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.88ms. Allocated memory is still 102.8MB. Free memory was 71.8MB in the beginning and 76.1MB in the end (delta: -4.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.37ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.65ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.47ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 53.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 770.91ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 52.7MB in the beginning and 77.3MB in the end (delta: -24.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory is still 77.3MB. 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: 122]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 45, overapproximation of bitwiseAnd at line 21. Possible FailurePath: [L25-L29] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L31] static const float zero_log = 0.0; VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, zero_log=0] [L117] float x = 0.0f; [L118] CALL, EXPR __ieee754_logf(x) [L34] float hfsq, f, s, z, R, w, t1, t2, dk; [L35] __int32_t k, ix, i, j; VAL [\old(x)=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=0, zero_log=0] [L38] ieee_float_shape_type gf_u; [L39] gf_u.value = (x) [L40] EXPR gf_u.word [L40] (ix) = gf_u.word [L43] k = 0 VAL [\old(x)=0, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=0, zero_log=0] [L44] COND TRUE ((ix & 0x7fffffff) == 0) [L45] return -two25_log / zero_log; VAL [\old(x)=0, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=0, zero_log=0] [L118] RET, EXPR __ieee754_logf(x) [L118] float res = __ieee754_logf(x); [L121] CALL, EXPR isinf_float(res) [L15] __int32_t ix; VAL [\old(x)=4294967304, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=4294967304, zero_log=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (ix) = gf_u.word [L21] ix &= 0x7fffffff [L22] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967304, \result=0, ix=1, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=4294967304, zero_log=0] [L121] RET, EXPR isinf_float(res) [L121] COND TRUE !isinf_float(res) [L122] reach_error() VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, res=4294967304, two25_log=33554432, x=0, zero_log=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:44:21,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_0910a.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 1985c142f4bad82ade144c3cf2f9b0ec416a6e8e883d7c5dd74ff953a2b83fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:44:23,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:44:23,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:44:23,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:44:23,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:44:23,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:44:23,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:44:23,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:44:23,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:44:23,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:44:23,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:44:23,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:44:23,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:44:23,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:44:23,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:44:23,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:44:23,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:44:23,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:44:23,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:44:23,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:44:23,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:44:23,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:44:23,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:44:23,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:44:23,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:44:23,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:44:23,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:44:23,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:44:23,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:44:23,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:44:23,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:44:23,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:44:23,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:44:23,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:44:23,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:44:23,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:44:23,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:44:23,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:44:23,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:44:23,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:44:23,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:44:23,879 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:44:23,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:44:23,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:44:23,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:44:23,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:44:23,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:44:23,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:44:23,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:44:23,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:44:23,911 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:44:23,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:44:23,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:44:23,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:44:23,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:44:23,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:44:23,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:44:23,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:44:23,913 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:44:23,913 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:44:23,913 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:44:23,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:44:23,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:44:23,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:44:23,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:44:23,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:44:23,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:44:23,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:44:23,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:44:23,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:44:23,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:44:23,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:44:23,916 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:44:23,916 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:44:23,916 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:44:23,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:44:23,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:44:23,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:44:23,917 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 -> 1985c142f4bad82ade144c3cf2f9b0ec416a6e8e883d7c5dd74ff953a2b83fc0 [2022-02-20 16:44:24,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:44:24,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:44:24,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:44:24,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:44:24,169 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:44:24,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0910a.c [2022-02-20 16:44:24,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7597286/e59a4700c181406cb33408254de42eb3/FLAG2b8c830fc [2022-02-20 16:44:24,586 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:44:24,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0910a.c [2022-02-20 16:44:24,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7597286/e59a4700c181406cb33408254de42eb3/FLAG2b8c830fc [2022-02-20 16:44:24,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7597286/e59a4700c181406cb33408254de42eb3 [2022-02-20 16:44:24,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:44:24,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:44:24,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:44:24,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:44:24,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:44:24,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:24,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319f5602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24, skipping insertion in model container [2022-02-20 16:44:24,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:24,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:44:24,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:44:24,838 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_0910a.c[3092,3105] [2022-02-20 16:44:24,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:44:24,866 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:44:24,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0910a.c[3092,3105] [2022-02-20 16:44:24,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:44:24,935 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:44:24,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24 WrapperNode [2022-02-20 16:44:24,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:44:24,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:44:24,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:44:24,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:44:24,944 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:44:24" (1/1) ... [2022-02-20 16:44:24,961 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:44:24" (1/1) ... [2022-02-20 16:44:24,992 INFO L137 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2022-02-20 16:44:24,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:44:24,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:44:24,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:44:24,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:44:25,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:44:25,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:44:25,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:44:25,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:44:25,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (1/1) ... [2022-02-20 16:44:25,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:44:25,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:44:25,141 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:44:25,156 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:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:44:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:44:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:44:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:44:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:44:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:44:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:44:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:44:25,278 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:44:25,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:44:40,736 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:44:40,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:44:40,741 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:44:40,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:44:40 BoogieIcfgContainer [2022-02-20 16:44:40,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:44:40,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:44:40,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:44:40,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:44:40,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:44:24" (1/3) ... [2022-02-20 16:44:40,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88c53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:44:40, skipping insertion in model container [2022-02-20 16:44:40,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:44:24" (2/3) ... [2022-02-20 16:44:40,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88c53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:44:40, skipping insertion in model container [2022-02-20 16:44:40,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:44:40" (3/3) ... [2022-02-20 16:44:40,748 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0910a.c [2022-02-20 16:44:40,751 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:44:40,752 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:44:40,781 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:44:40,786 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:44:40,787 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:44:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 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:44:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:44:40,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:40,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:40,805 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash -179144357, now seen corresponding path program 1 times [2022-02-20 16:44:40,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:44:40,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404717287] [2022-02-20 16:44:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:40,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:44:40,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:44:40,826 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:44:40,837 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:44:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:41,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:44:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:41,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:44:41,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ln2_hi_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256));~ln2_lo_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6));~two25_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.3554432E7));~Lg1_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.66666668653));~Lg2_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.40000000596));~Lg3_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.28571429849));~Lg4_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.22222198546));~Lg5_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.1818357259));~Lg6_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.15313838422));~Lg7_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.1479819864));~zero_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {36#true} is VALID [2022-02-20 16:44:41,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline___ieee754_logf } true;__ieee754_logf_#in~x#1 := main_~x~0#1;havoc __ieee754_logf_#res#1;havoc __ieee754_logf_#t~mem5#1, __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset, __ieee754_logf_#t~mem6#1, __ieee754_logf_~#gf_u~2#1.base, __ieee754_logf_~#gf_u~2#1.offset, __ieee754_logf_#t~mem7#1, __ieee754_logf_~#sf_u~0#1.base, __ieee754_logf_~#sf_u~0#1.offset, __ieee754_logf_~x#1, __ieee754_logf_~hfsq~0#1, __ieee754_logf_~f~0#1, __ieee754_logf_~s~0#1, __ieee754_logf_~z~0#1, __ieee754_logf_~R~0#1, __ieee754_logf_~w~0#1, __ieee754_logf_~t1~0#1, __ieee754_logf_~t2~0#1, __ieee754_logf_~dk~0#1, __ieee754_logf_~k~0#1, __ieee754_logf_~ix~1#1, __ieee754_logf_~i~0#1, __ieee754_logf_~j~0#1;__ieee754_logf_~x#1 := __ieee754_logf_#in~x#1;havoc __ieee754_logf_~hfsq~0#1;havoc __ieee754_logf_~f~0#1;havoc __ieee754_logf_~s~0#1;havoc __ieee754_logf_~z~0#1;havoc __ieee754_logf_~R~0#1;havoc __ieee754_logf_~w~0#1;havoc __ieee754_logf_~t1~0#1;havoc __ieee754_logf_~t2~0#1;havoc __ieee754_logf_~dk~0#1;havoc __ieee754_logf_~k~0#1;havoc __ieee754_logf_~ix~1#1;havoc __ieee754_logf_~i~0#1;havoc __ieee754_logf_~j~0#1; {36#true} is VALID [2022-02-20 16:44:41,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:44:41,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} __ieee754_logf_~k~0#1 := 0bv32; {37#false} is VALID [2022-02-20 16:44:41,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume 0bv32 == ~bvand32(2147483647bv32, __ieee754_logf_~ix~1#1);__ieee754_logf_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~two25_log~0), ~zero_log~0); {37#false} is VALID [2022-02-20 16:44:41,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main_#t~ret8#1 := __ieee754_logf_#res#1;assume { :end_inline___ieee754_logf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem4#1, isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {37#false} is VALID [2022-02-20 16:44:41,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-02-20 16:44:41,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {37#false} is VALID [2022-02-20 16:44:41,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {37#false} is VALID [2022-02-20 16:44:41,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {37#false} is VALID [2022-02-20 16:44:41,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:44:41,391 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:44:41,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:44:41,392 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:44:41,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404717287] [2022-02-20 16:44:41,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404717287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:41,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:41,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:44:41,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287380296] [2022-02-20 16:44:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:44:41,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:41,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:41,527 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:44:41,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:44:41,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:44:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:44:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:44:41,567 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:57,599 INFO L93 Difference]: Finished difference Result 64 states and 102 transitions. [2022-02-20 16:44:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:44:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:44:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2022-02-20 16:44:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2022-02-20 16:44:57,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2022-02-20 16:45:00,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:00,729 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:45:00,729 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:45:00,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:00,738 INFO L933 BasicCegarLoop]: 43 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, 43 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:45:00,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:45:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:45:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:45:00,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:45:00,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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:45:00,765 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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:45:00,766 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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:45:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:00,772 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:45:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:45:00,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:00,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:00,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:45:00,774 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:45:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:00,778 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:45:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:45:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:00,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:00,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:45:00,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:45:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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:45:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-02-20 16:45:00,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 11 [2022-02-20 16:45:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:45:00,786 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-20 16:45:00,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:45:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:45:00,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:00,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:00,808 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:45:01,007 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:45:01,008 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 574087680, now seen corresponding path program 1 times [2022-02-20 16:45:01,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:45:01,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304516016] [2022-02-20 16:45:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:01,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:45:01,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:45:01,011 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:45:01,013 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:45:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:01,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:45:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:01,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:45:02,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ln2_hi_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256));~ln2_lo_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6));~two25_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.3554432E7));~Lg1_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.66666668653));~Lg2_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.40000000596));~Lg3_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.28571429849));~Lg4_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.22222198546));~Lg5_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.1818357259));~Lg6_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.15313838422));~Lg7_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.1479819864));~zero_log~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:45:02,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline___ieee754_logf } true;__ieee754_logf_#in~x#1 := main_~x~0#1;havoc __ieee754_logf_#res#1;havoc __ieee754_logf_#t~mem5#1, __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset, __ieee754_logf_#t~mem6#1, __ieee754_logf_~#gf_u~2#1.base, __ieee754_logf_~#gf_u~2#1.offset, __ieee754_logf_#t~mem7#1, __ieee754_logf_~#sf_u~0#1.base, __ieee754_logf_~#sf_u~0#1.offset, __ieee754_logf_~x#1, __ieee754_logf_~hfsq~0#1, __ieee754_logf_~f~0#1, __ieee754_logf_~s~0#1, __ieee754_logf_~z~0#1, __ieee754_logf_~R~0#1, __ieee754_logf_~w~0#1, __ieee754_logf_~t1~0#1, __ieee754_logf_~t2~0#1, __ieee754_logf_~dk~0#1, __ieee754_logf_~k~0#1, __ieee754_logf_~ix~1#1, __ieee754_logf_~i~0#1, __ieee754_logf_~j~0#1;__ieee754_logf_~x#1 := __ieee754_logf_#in~x#1;havoc __ieee754_logf_~hfsq~0#1;havoc __ieee754_logf_~f~0#1;havoc __ieee754_logf_~s~0#1;havoc __ieee754_logf_~z~0#1;havoc __ieee754_logf_~R~0#1;havoc __ieee754_logf_~w~0#1;havoc __ieee754_logf_~t1~0#1;havoc __ieee754_logf_~t2~0#1;havoc __ieee754_logf_~dk~0#1;havoc __ieee754_logf_~k~0#1;havoc __ieee754_logf_~ix~1#1;havoc __ieee754_logf_~i~0#1;havoc __ieee754_logf_~j~0#1; {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:45:02,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_logf_~x#1, __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset, 4bv32);call __ieee754_logf_#t~mem5#1 := read~intINTTYPE4(__ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset, 4bv32);__ieee754_logf_~ix~1#1 := __ieee754_logf_#t~mem5#1;havoc __ieee754_logf_#t~mem5#1;call ULTIMATE.dealloc(__ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset);havoc __ieee754_logf_~#gf_u~1#1.base, __ieee754_logf_~#gf_u~1#1.offset; {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:45:02,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} goto; {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:45:02,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_logf_~k~0#1 := 0bv32; {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:45:02,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (= ~two25_log~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 33554432.0))) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 == ~bvand32(2147483647bv32, __ieee754_logf_~ix~1#1);__ieee754_logf_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~two25_log~0), ~zero_log~0); {265#(= |ULTIMATE.start___ieee754_logf_#res#1| (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))))} is VALID [2022-02-20 16:45:02,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(= |ULTIMATE.start___ieee754_logf_#res#1| (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))))} main_#t~ret8#1 := __ieee754_logf_#res#1;assume { :end_inline___ieee754_logf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem4#1, isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {269#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) |ULTIMATE.start_isinf_float_~x#1|)} is VALID [2022-02-20 16:45:02,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) |ULTIMATE.start_isinf_float_~x#1|)} call isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset, 4bv32);call isinf_float_#t~mem4#1 := read~intINTTYPE4(isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem4#1;havoc isinf_float_#t~mem4#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset);havoc isinf_float_~#gf_u~0#1.base, isinf_float_~#gf_u~0#1.offset; {273#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} is VALID [2022-02-20 16:45:02,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} goto; {273#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} is VALID [2022-02-20 16:45:02,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 33554432.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {280#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:45:02,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {284#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:45:02,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {245#false} is VALID [2022-02-20 16:45:02,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 16:45:02,516 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:45:02,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:45:02,516 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:45:02,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304516016] [2022-02-20 16:45:02,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304516016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:45:02,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:45:02,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:45:02,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914885918] [2022-02-20 16:45:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:45:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:45:02,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:45:02,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:02,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:02,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:45:02,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:45:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:45:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:45:02,691 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:11,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:15,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:17,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:19,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:22,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:24,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:26,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:31,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:33,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:35,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:37,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:45:39,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []