./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0833.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0833.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 b63eb992c00c845168476a1db77eced17c7e9aa742c6bcee68b2e04a80fb6c93 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:57:52,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:57:52,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:57:52,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:57:52,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:57:52,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:57:52,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:57:52,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:57:52,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:57:52,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:57:52,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:57:52,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:57:52,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:57:52,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:57:52,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:57:52,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:57:52,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:57:52,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:57:52,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:57:52,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:57:52,670 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:57:52,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:57:52,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:57:52,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:57:52,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:57:52,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:57:52,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:57:52,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:57:52,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:57:52,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:57:52,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:57:52,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:57:52,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:57:52,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:57:52,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:57:52,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:57:52,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:57:52,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:57:52,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:57:52,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:57:52,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:57:52,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:57:52,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:57:52,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:57:52,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:57:52,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:57:52,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:57:52,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:57:52,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:57:52,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:57:52,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:57:52,724 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:57:52,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:57:52,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:57:52,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:57:52,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:57:52,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:57:52,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:57:52,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:57:52,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:57:52,726 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:57:52,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:57:52,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:57:52,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:57:52,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:57:52,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:57:52,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:57:52,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:57:52,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:57:52,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:57:52,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:57:52,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:57:52,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:57:52,730 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:57:52,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:57:52,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:57:52,730 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 -> b63eb992c00c845168476a1db77eced17c7e9aa742c6bcee68b2e04a80fb6c93 [2022-07-12 02:57:52,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:57:53,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:57:53,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:57:53,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:57:53,019 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:57:53,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0833.c [2022-07-12 02:57:53,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a787dd40b/e645a04b6d0245e5bb65c595d61c163f/FLAG7742e114e [2022-07-12 02:57:53,489 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:57:53,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0833.c [2022-07-12 02:57:53,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a787dd40b/e645a04b6d0245e5bb65c595d61c163f/FLAG7742e114e [2022-07-12 02:57:53,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a787dd40b/e645a04b6d0245e5bb65c595d61c163f [2022-07-12 02:57:53,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:57:53,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:57:53,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:57:53,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:57:53,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:57:53,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:57:53" (1/1) ... [2022-07-12 02:57:53,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a675e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:53, skipping insertion in model container [2022-07-12 02:57:53,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:57:53" (1/1) ... [2022-07-12 02:57:53,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:57:53,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:57:54,122 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/double_req_bl_0833.c[4075,4088] [2022-07-12 02:57:54,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:57:54,142 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:57:54,194 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/double_req_bl_0833.c[4075,4088] [2022-07-12 02:57:54,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:57:54,207 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:57:54,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54 WrapperNode [2022-07-12 02:57:54,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:57:54,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:57:54,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:57:54,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:57:54,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,267 INFO L137 Inliner]: procedures = 18, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 213 [2022-07-12 02:57:54,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:57:54,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:57:54,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:57:54,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:57:54,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:57:54,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:57:54,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:57:54,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:57:54,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (1/1) ... [2022-07-12 02:57:54,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:57:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:57:54,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:57:54,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:57:54,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:57:54,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:57:54,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:57:54,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:57:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:57:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:57:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:57:54,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:57:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:57:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:57:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:57:54,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:57:54,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:57:54,769 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:57:54,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:57:54,781 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-12 02:57:54,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:54 BoogieIcfgContainer [2022-07-12 02:57:54,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:57:54,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:57:54,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:57:54,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:57:54,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:57:53" (1/3) ... [2022-07-12 02:57:54,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60038971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:57:54, skipping insertion in model container [2022-07-12 02:57:54,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:54" (2/3) ... [2022-07-12 02:57:54,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60038971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:57:54, skipping insertion in model container [2022-07-12 02:57:54,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:54" (3/3) ... [2022-07-12 02:57:54,792 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833.c [2022-07-12 02:57:54,806 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:57:54,807 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:57:54,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:57:54,877 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a2884f4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bfe7536 [2022-07-12 02:57:54,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:57:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 47 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:57:54,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:54,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:54,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2073017922, now seen corresponding path program 1 times [2022-07-12 02:57:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:57:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097213873] [2022-07-12 02:57:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:57:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:57:55,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097213873] [2022-07-12 02:57:55,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097213873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:55,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:57:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841255991] [2022-07-12 02:57:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:55,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:57:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:57:55,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:57:55,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:57:55,104 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 47 states have internal predecessors, (79), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:55,131 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2022-07-12 02:57:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:57:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:57:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:55,145 INFO L225 Difference]: With dead ends: 93 [2022-07-12 02:57:55,146 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 02:57:55,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:57:55,152 INFO L413 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:55,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:57:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 02:57:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-12 02:57:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-07-12 02:57:55,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 12 [2022-07-12 02:57:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:55,191 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-12 02:57:55,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-07-12 02:57:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 02:57:55,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:55,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:57:55,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash -184269883, now seen corresponding path program 1 times [2022-07-12 02:57:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:57:55,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307085981] [2022-07-12 02:57:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:57:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:57:55,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:57:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:57:55,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:57:55,329 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:57:55,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:57:55,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:57:55,337 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 02:57:55,340 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:57:55,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:57:55 BoogieIcfgContainer [2022-07-12 02:57:55,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:57:55,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:57:55,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:57:55,396 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:57:55,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:54" (3/4) ... [2022-07-12 02:57:55,400 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:57:55,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:57:55,401 INFO L158 Benchmark]: Toolchain (without parser) took 1493.52ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 48.8MB in the end (delta: 43.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,402 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:57:55,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.53ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 100.0MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 125.8MB. Free memory was 100.0MB in the beginning and 97.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,408 INFO L158 Benchmark]: Boogie Preprocessor took 53.53ms. Allocated memory is still 125.8MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,408 INFO L158 Benchmark]: RCFGBuilder took 460.29ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 78.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,409 INFO L158 Benchmark]: TraceAbstraction took 610.85ms. Allocated memory is still 125.8MB. Free memory was 78.2MB in the beginning and 48.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-12 02:57:55,409 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 125.8MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:57:55,414 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.53ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 100.0MB in the end (delta: -7.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 125.8MB. Free memory was 100.0MB in the beginning and 97.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.53ms. Allocated memory is still 125.8MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.29ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 78.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 610.85ms. Allocated memory is still 125.8MB. Free memory was 78.2MB in the beginning and 48.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 125.8MB. Free memory is still 48.8MB. 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: 155]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 23, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73, overapproximation of bitwiseAnd at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 154. Possible FailurePath: [L19-L44] static const double one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+300, twom1000_exp = 9.33263618503218878990e-302, o_threshold_exp = 7.09782712893383973096e+02, u_threshold_exp = -7.45133219101941108420e+02, ln2HI_exp[2] = { 6.93147180369123816490e-01, -6.93147180369123816490e-01, }, ln2LO_exp[2] = { 1.90821492927058770002e-10, -1.90821492927058770002e-10, }, invln2_exp = 1.44269504088896338700e+00, P1_exp = 1.66666666666666019037e-01, P2_exp = -2.77777777770155933842e-03, P3_exp = 6.61375632143793436117e-05, P4_exp = -1.65339022054652515390e-06, P5_exp = 4.13813679705723846039e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L151] double x = -1.0 / 0.0; [L152] CALL, EXPR __ieee754_exp(x) [L47] double y, hi, lo, c, t; [L48] __int32_t k = 0, xsb; [L49] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] [L52] ieee_double_shape_type gh_u; [L53] gh_u.value = (x) [L54] EXPR gh_u.parts.msw [L54] (hx) = gh_u.parts.msw [L56] xsb = (hx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=9, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L57] hx &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L59] COND TRUE hx >= 0x40862E42 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L60] COND FALSE !(hx >= 0x7ff00000) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L72] COND TRUE x > o_threshold_exp [L73] return huge_exp * huge_exp; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L152] RET, EXPR __ieee754_exp(x) [L152] double res = __ieee754_exp(x); [L154] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, res == 0.0 && __signbit_double(res) == 0=0, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] [L154] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L155] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 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, 61 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=48occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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-07-12 02:57:55,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0833.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 b63eb992c00c845168476a1db77eced17c7e9aa742c6bcee68b2e04a80fb6c93 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:57:57,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:57:57,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:57:57,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:57:57,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:57:57,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:57:57,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:57:57,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:57:57,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:57:57,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:57:57,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:57:57,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:57:57,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:57:57,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:57:57,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:57:57,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:57:57,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:57:57,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:57:57,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:57:57,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:57:57,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:57:57,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:57:57,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:57:57,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:57:57,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:57:57,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:57:57,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:57:57,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:57:57,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:57:57,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:57:57,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:57:57,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:57:57,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:57:57,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:57:57,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:57:57,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:57:57,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:57:57,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:57:57,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:57:57,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:57:57,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:57:57,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:57:57,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:57:57,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:57:57,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:57:57,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:57:57,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:57:57,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:57:57,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:57:57,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:57:57,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:57:57,578 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:57:57,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:57:57,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:57:57,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:57:57,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:57:57,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:57:57,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:57:57,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:57:57,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:57:57,589 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:57:57,589 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:57:57,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:57:57,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:57:57,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:57:57,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:57:57,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:57:57,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:57:57,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:57:57,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:57:57,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:57:57,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:57:57,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:57:57,592 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:57:57,592 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:57:57,592 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:57:57,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:57:57,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:57:57,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:57:57,593 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 -> b63eb992c00c845168476a1db77eced17c7e9aa742c6bcee68b2e04a80fb6c93 [2022-07-12 02:57:57,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:57:57,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:57:57,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:57:57,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:57:57,925 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:57:57,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0833.c [2022-07-12 02:57:57,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a14b6e41/5e68b7f516b34b798e98374a78a1cace/FLAG7d603d7af [2022-07-12 02:57:58,449 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:57:58,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0833.c [2022-07-12 02:57:58,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a14b6e41/5e68b7f516b34b798e98374a78a1cace/FLAG7d603d7af [2022-07-12 02:57:58,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a14b6e41/5e68b7f516b34b798e98374a78a1cace [2022-07-12 02:57:58,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:57:58,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:57:58,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:57:58,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:57:58,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:57:58,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:57:58" (1/1) ... [2022-07-12 02:57:58,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2468e110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:58, skipping insertion in model container [2022-07-12 02:57:58,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:57:58" (1/1) ... [2022-07-12 02:57:58,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:57:58,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:57:59,020 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/double_req_bl_0833.c[4075,4088] [2022-07-12 02:57:59,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:57:59,042 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:57:59,102 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/double_req_bl_0833.c[4075,4088] [2022-07-12 02:57:59,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:57:59,130 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:57:59,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59 WrapperNode [2022-07-12 02:57:59,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:57:59,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:57:59,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:57:59,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:57:59,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,173 INFO L137 Inliner]: procedures = 21, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 201 [2022-07-12 02:57:59,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:57:59,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:57:59,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:57:59,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:57:59,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:57:59,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:57:59,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:57:59,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:57:59,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (1/1) ... [2022-07-12 02:57:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:57:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:57:59,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:57:59,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:57:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:57:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:57:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:57:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:57:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:57:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-12 02:57:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 02:57:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:57:59,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:57:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 02:57:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:57:59,364 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:57:59,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:58:12,065 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:58:12,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:58:12,071 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-12 02:58:12,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:58:12 BoogieIcfgContainer [2022-07-12 02:58:12,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:58:12,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:58:12,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:58:12,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:58:12,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:57:58" (1/3) ... [2022-07-12 02:58:12,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7792dc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:58:12, skipping insertion in model container [2022-07-12 02:58:12,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:57:59" (2/3) ... [2022-07-12 02:58:12,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7792dc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:58:12, skipping insertion in model container [2022-07-12 02:58:12,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:58:12" (3/3) ... [2022-07-12 02:58:12,087 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833.c [2022-07-12 02:58:12,101 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:58:12,101 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:58:12,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:58:12,171 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10de6aeb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50a7f27d [2022-07-12 02:58:12,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:58:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:58:12,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:12,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:12,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1722268475, now seen corresponding path program 1 times [2022-07-12 02:58:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:12,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321511729] [2022-07-12 02:58:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:12,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:12,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:58:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:12,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:58:12,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:12,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:12,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321511729] [2022-07-12 02:58:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321511729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:58:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299675036] [2022-07-12 02:58:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:12,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:58:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:58:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:58:12,695 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 43 states have internal predecessors, (71), 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-07-12 02:58:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:12,718 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2022-07-12 02:58:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:58:12,720 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-07-12 02:58:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:12,727 INFO L225 Difference]: With dead ends: 86 [2022-07-12 02:58:12,727 INFO L226 Difference]: Without dead ends: 41 [2022-07-12 02:58:12,729 INFO L412 NwaCegarLoop]: 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-07-12 02:58:12,733 INFO L413 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:12,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:58:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-12 02:58:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-12 02:58:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-07-12 02:58:12,770 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 11 [2022-07-12 02:58:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:12,770 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-07-12 02:58:12,771 INFO L496 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-07-12 02:58:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-07-12 02:58:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:58:12,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:12,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:12,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 02:58:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:12,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:12,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1102347550, now seen corresponding path program 1 times [2022-07-12 02:58:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:12,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007072598] [2022-07-12 02:58:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:12,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:12,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:12,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:12,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:58:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:58:13,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:14,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:14,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:14,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007072598] [2022-07-12 02:58:14,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007072598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:14,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:14,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:58:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553003378] [2022-07-12 02:58:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:14,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:58:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:58:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:14,230 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:14,248 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-07-12 02:58:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:58:14,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:58:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:14,250 INFO L225 Difference]: With dead ends: 68 [2022-07-12 02:58:14,250 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 02:58:14,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:14,252 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:14,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 34 Unchecked, 0.0s Time] [2022-07-12 02:58:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 02:58:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-12 02:58:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-12 02:58:14,258 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 12 [2022-07-12 02:58:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:14,258 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-12 02:58:14,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-07-12 02:58:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 02:58:14,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:14,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:14,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:14,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:14,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:14,477 INFO L85 PathProgramCache]: Analyzing trace with hash -5323571, now seen corresponding path program 1 times [2022-07-12 02:58:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:14,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63992301] [2022-07-12 02:58:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:14,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:14,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:14,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:14,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:58:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:14,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:58:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:15,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:15,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63992301] [2022-07-12 02:58:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63992301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:15,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:15,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:58:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566802336] [2022-07-12 02:58:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:58:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:58:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:15,485 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07-12 02:58:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:15,489 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-12 02:58:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:58:15,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07-12 02:58:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:15,489 INFO L225 Difference]: With dead ends: 48 [2022-07-12 02:58:15,489 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 02:58:15,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:15,491 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:15,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-12 02:58:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 02:58:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 02:58:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-12 02:58:15,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2022-07-12 02:58:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:15,494 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-12 02:58:15,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-07-12 02:58:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-12 02:58:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 02:58:15,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:15,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:15,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:15,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:15,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -691534902, now seen corresponding path program 1 times [2022-07-12 02:58:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:15,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286664806] [2022-07-12 02:58:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:15,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:15,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:58:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:15,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 02:58:15,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:16,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:58:17,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 02:58:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:18,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:18,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:18,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286664806] [2022-07-12 02:58:18,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286664806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:18,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:18,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:58:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765435441] [2022-07-12 02:58:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:18,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:58:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:58:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:58:18,234 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:18,239 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-07-12 02:58:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:58:18,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-07-12 02:58:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:18,240 INFO L225 Difference]: With dead ends: 30 [2022-07-12 02:58:18,240 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 02:58:18,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:58:18,242 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:18,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 02:58:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 02:58:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 02:58:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-12 02:58:18,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-07-12 02:58:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:18,245 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-12 02:58:18,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-12 02:58:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 02:58:18,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:18,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:18,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 02:58:18,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:18,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -129518544, now seen corresponding path program 1 times [2022-07-12 02:58:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092713442] [2022-07-12 02:58:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:18,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:18,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:18,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:18,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:58:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:18,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:58:18,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:19,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:19,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:19,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092713442] [2022-07-12 02:58:19,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092713442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:19,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:19,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:58:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378737056] [2022-07-12 02:58:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:19,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:58:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:58:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:19,800 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:19,802 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-12 02:58:19,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:58:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-07-12 02:58:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:19,806 INFO L225 Difference]: With dead ends: 31 [2022-07-12 02:58:19,808 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 02:58:19,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:19,809 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:19,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-12 02:58:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 02:58:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 02:58:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-07-12 02:58:19,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2022-07-12 02:58:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:19,814 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-07-12 02:58:19,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-07-12 02:58:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 02:58:19,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:19,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:19,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:20,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:20,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash -72260242, now seen corresponding path program 1 times [2022-07-12 02:58:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:20,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55900666] [2022-07-12 02:58:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:20,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:20,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:20,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:20,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 02:58:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:20,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 02:58:20,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:20,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:20,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:20,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55900666] [2022-07-12 02:58:20,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55900666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:20,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:20,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:58:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675133728] [2022-07-12 02:58:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:20,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:58:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:58:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:20,623 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:21,046 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-07-12 02:58:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:58:21,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-07-12 02:58:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:21,048 INFO L225 Difference]: With dead ends: 24 [2022-07-12 02:58:21,048 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 02:58:21,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:58:21,049 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:21,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 02:58:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 02:58:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 02:58:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-07-12 02:58:21,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2022-07-12 02:58:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:21,053 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-07-12 02:58:21,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-07-12 02:58:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 02:58:21,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:21,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:21,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:21,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1346464765, now seen corresponding path program 1 times [2022-07-12 02:58:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:21,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697903891] [2022-07-12 02:58:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:21,264 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:21,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 02:58:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:21,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 02:58:21,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:23,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:23,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697903891] [2022-07-12 02:58:23,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697903891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:23,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:23,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 02:58:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769854414] [2022-07-12 02:58:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:23,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 02:58:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 02:58:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 02:58:23,390 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:24,937 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-07-12 02:58:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 02:58:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 20 [2022-07-12 02:58:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:24,938 INFO L225 Difference]: With dead ends: 21 [2022-07-12 02:58:24,938 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 02:58:24,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 02:58:24,941 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:24,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 5 Unchecked, 0.5s Time] [2022-07-12 02:58:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 02:58:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 02:58:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 02:58:24,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-07-12 02:58:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:24,942 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 02:58:24,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 02:58:24,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 02:58:24,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:58:24,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:25,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:25,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 02:58:25,791 INFO L902 garLoopResultBuilder]: At program point L159(lines 145 160) the Hoare annotation is: true [2022-07-12 02:58:25,792 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 71) no Hoare annotation was computed. [2022-07-12 02:58:25,792 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 118 122) no Hoare annotation was computed. [2022-07-12 02:58:25,792 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 122) the Hoare annotation is: false [2022-07-12 02:58:25,792 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-07-12 02:58:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 02:58:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 02:58:25,793 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 136 140) no Hoare annotation was computed. [2022-07-12 02:58:25,793 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-07-12 02:58:25,793 INFO L895 garLoopResultBuilder]: At program point L136-2(lines 136 140) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (= |ULTIMATE.start_main_~res~0#1| (_ +zero 11 53)) (= (_ +zero 11 53) |ULTIMATE.start___signbit_double_~x#1|) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_exp_#res#1|)) [2022-07-12 02:58:25,793 INFO L899 garLoopResultBuilder]: For program point L136-3(lines 136 140) no Hoare annotation was computed. [2022-07-12 02:58:25,793 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-07-12 02:58:25,793 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 62 66) no Hoare annotation was computed. [2022-07-12 02:58:25,794 INFO L895 garLoopResultBuilder]: At program point L62-2(lines 62 66) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10|) (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) |ULTIMATE.start___ieee754_exp_~x#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) .cse0) (= (bvand (_ bv2147483647 32) .cse0) |ULTIMATE.start___ieee754_exp_~hx~0#1|)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_exp_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (bvlshr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|) (_ bv31 32)) (_ bv1 32)) |ULTIMATE.start___ieee754_exp_~xsb~0#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|)))))) [2022-07-12 02:58:25,794 INFO L899 garLoopResultBuilder]: For program point L62-3(lines 60 71) no Hoare annotation was computed. [2022-07-12 02:58:25,794 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 88) no Hoare annotation was computed. [2022-07-12 02:58:25,794 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 79 88) no Hoare annotation was computed. [2022-07-12 02:58:25,794 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 104 108) no Hoare annotation was computed. [2022-07-12 02:58:25,794 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 108) the Hoare annotation is: false [2022-07-12 02:58:25,794 INFO L895 garLoopResultBuilder]: At program point L129(lines 46 131) the Hoare annotation is: (= (_ +zero 11 53) |ULTIMATE.start___ieee754_exp_#res#1|) [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L154-2(lines 154 157) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 101) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 128) no Hoare annotation was computed. [2022-07-12 02:58:25,795 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 93) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 116 130) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point L123-2(lines 123 128) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point L90-2(lines 78 93) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 75) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 02:58:25,796 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 92) no Hoare annotation was computed. [2022-07-12 02:58:25,797 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 76) no Hoare annotation was computed. [2022-07-12 02:58:25,797 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 46 131) no Hoare annotation was computed. [2022-07-12 02:58:25,797 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 55) no Hoare annotation was computed. [2022-07-12 02:58:25,797 INFO L895 garLoopResultBuilder]: At program point L51-2(lines 51 55) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_exp_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) [2022-07-12 02:58:25,797 INFO L899 garLoopResultBuilder]: For program point L51-3(lines 51 55) no Hoare annotation was computed. [2022-07-12 02:58:25,797 INFO L895 garLoopResultBuilder]: At program point L142(lines 133 143) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19#1| (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_exp_#res#1|)) [2022-07-12 02:58:25,797 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-07-12 02:58:25,798 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 102 116) no Hoare annotation was computed. [2022-07-12 02:58:25,798 INFO L899 garLoopResultBuilder]: For program point L109-2(lines 109 114) no Hoare annotation was computed. [2022-07-12 02:58:25,800 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:25,802 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:58:25,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:58:25 BoogieIcfgContainer [2022-07-12 02:58:25,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:58:25,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:58:25,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:58:25,821 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:58:25,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:58:12" (3/4) ... [2022-07-12 02:58:25,823 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 02:58:25,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-07-12 02:58:25,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-12 02:58:25,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 02:58:25,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 02:58:25,852 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:58:25,852 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10 : bv32, v_skolemized_q#valueAsBitvector_27 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_27[63:63], v_skolemized_q#valueAsBitvector_27[62:52], v_skolemized_q#valueAsBitvector_27[51:0]) == x && v_skolemized_q#valueAsBitvector_27[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10][4bv32]) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10][4bv32]) == hx) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand32(~bvlshr32(v_skolemized_q#valueAsBitvector_32[63:32], 31bv32), 1bv32) == xsb && ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) [2022-07-12 02:58:25,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~Pluszero~LONGDOUBLE() == \result [2022-07-12 02:58:25,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((aux-res == 0.0 && __signbit_double(res) == 0-aux && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 02:58:25,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 02:58:25,881 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 02:58:25,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:58:25,882 INFO L158 Benchmark]: Toolchain (without parser) took 27035.86ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 32.3MB in the end (delta: -5.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,882 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:58:25,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.29ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.1MB in the beginning and 46.4MB in the end (delta: -19.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 44.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:58:25,883 INFO L158 Benchmark]: Boogie Preprocessor took 30.48ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 41.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,883 INFO L158 Benchmark]: RCFGBuilder took 12869.67ms. Allocated memory is still 65.0MB. Free memory was 41.8MB in the beginning and 37.6MB in the end (delta: 4.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,884 INFO L158 Benchmark]: TraceAbstraction took 13742.96ms. Allocated memory is still 65.0MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 596.1kB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,884 INFO L158 Benchmark]: Witness Printer took 61.06ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 32.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:58:25,886 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.5MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.29ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 27.1MB in the beginning and 46.4MB in the end (delta: -19.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 44.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.48ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 41.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 12869.67ms. Allocated memory is still 65.0MB. Free memory was 41.8MB in the beginning and 37.6MB in the end (delta: 4.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13742.96ms. Allocated memory is still 65.0MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 596.1kB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 61.06ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 32.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 182 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 99 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 28 QuantifiedInterpolants, 771 SizeOfPredicates, 35 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 51]: Loop Invariant [2022-07-12 02:58:25,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 62]: Loop Invariant [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_27,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:25,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] [2022-07-12 02:58:25,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_32,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10 : bv32, v_skolemized_q#valueAsBitvector_27 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_27[63:63], v_skolemized_q#valueAsBitvector_27[62:52], v_skolemized_q#valueAsBitvector_27[51:0]) == x && v_skolemized_q#valueAsBitvector_27[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10][4bv32]) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_exp_~#gh_u~0#1.base_10][4bv32]) == hx) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_32 : bv64, currentRoundingMode : FloatRoundingMode :: ~bvand32(~bvlshr32(v_skolemized_q#valueAsBitvector_32[63:32], 31bv32), 1bv32) == xsb && ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_32[63:63], v_skolemized_q#valueAsBitvector_32[62:52], v_skolemized_q#valueAsBitvector_32[51:0])) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((aux-res == 0.0 && __signbit_double(res) == 0-aux && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result) && ~Pluszero~LONGDOUBLE() == \result RESULT: Ultimate proved your program to be correct! [2022-07-12 02:58:26,123 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 02:58:26,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE