./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1032a.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_1032a.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 1d77f189616851dfc2a9becddf3926b3a4d1b6826934ea34b3559c7d217e0a16 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:06,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:06,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:06,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:06,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:06,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:06,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:06,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:06,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:06,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:06,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:06,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:06,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:06,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:06,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:06,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:06,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:06,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:06,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:06,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:06,170 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:06,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:06,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:06,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:06,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:06,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:06,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:06,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:06,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:06,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:06,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:06,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:06,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:06,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:06,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:06,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:06,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:06,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:06,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:06,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:06,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:06,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:06,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:03:06,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:06,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:06,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:06,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:06,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:06,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:06,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:06,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:06,211 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:06,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:06,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:06,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:03:06,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:06,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:06,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:06,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:06,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:06,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:06,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:06,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:06,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:06,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:06,216 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 -> 1d77f189616851dfc2a9becddf3926b3a4d1b6826934ea34b3559c7d217e0a16 [2022-07-12 03:03:06,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:06,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:06,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:06,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:06,405 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:06,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1032a.c [2022-07-12 03:03:06,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b029533/e69b6baed5d14d41a24f6c0fb82c778c/FLAG900cbd6c8 [2022-07-12 03:03:06,840 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:06,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032a.c [2022-07-12 03:03:06,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b029533/e69b6baed5d14d41a24f6c0fb82c778c/FLAG900cbd6c8 [2022-07-12 03:03:07,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b029533/e69b6baed5d14d41a24f6c0fb82c778c [2022-07-12 03:03:07,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:07,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:07,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:07,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:07,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:07,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214bda2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07, skipping insertion in model container [2022-07-12 03:03:07,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:07,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:07,460 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_1032a.c[2282,2295] [2022-07-12 03:03:07,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:07,473 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:07,514 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_1032a.c[2282,2295] [2022-07-12 03:03:07,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:07,528 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:07,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07 WrapperNode [2022-07-12 03:03:07,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:07,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:07,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:07,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:07,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,584 INFO L137 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-07-12 03:03:07,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:07,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:07,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:07,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:07,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:07,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:07,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:07,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:07,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (1/1) ... [2022-07-12 03:03:07,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:07,673 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 03:03:07,695 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 03:03:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:03:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:03:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:03:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:03:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:03:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:07,757 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:07,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:07,990 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:07,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:07,995 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:07,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:07 BoogieIcfgContainer [2022-07-12 03:03:07,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:07,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:07,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:08,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:08,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:07" (1/3) ... [2022-07-12 03:03:08,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f986ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:08, skipping insertion in model container [2022-07-12 03:03:08,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:07" (2/3) ... [2022-07-12 03:03:08,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f986ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:08, skipping insertion in model container [2022-07-12 03:03:08,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:07" (3/3) ... [2022-07-12 03:03:08,015 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032a.c [2022-07-12 03:03:08,031 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:08,032 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:08,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:08,088 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@4ab91cee, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24ebf959 [2022-07-12 03:03:08,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 03:03:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:03:08,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:08,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:08,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2068179301, now seen corresponding path program 1 times [2022-07-12 03:03:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:08,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374129990] [2022-07-12 03:03:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:08,225 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 03:03:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:08,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374129990] [2022-07-12 03:03:08,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374129990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:08,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:08,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809976587] [2022-07-12 03:03:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:08,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:08,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:08,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:08,261 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 03:03:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:08,276 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2022-07-12 03:03:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:08,278 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 03:03:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:08,284 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:03:08,285 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:03:08,287 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 03:03:08,291 INFO L413 NwaCegarLoop]: 38 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, 38 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 03:03:08,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:03:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:03:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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 03:03:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-12 03:03:08,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2022-07-12 03:03:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:08,320 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-12 03:03:08,320 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 03:03:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-07-12 03:03:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:08,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:08,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:08,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:03:08,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1606867070, now seen corresponding path program 1 times [2022-07-12 03:03:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:08,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655239856] [2022-07-12 03:03:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:08,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:03:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:08,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:03:08,530 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:03:08,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:08,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:03:08,539 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 03:03:08,541 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:08,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:08 BoogieIcfgContainer [2022-07-12 03:03:08,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:08,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:08,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:08,577 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:08,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:07" (3/4) ... [2022-07-12 03:03:08,580 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:03:08,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:08,582 INFO L158 Benchmark]: Toolchain (without parser) took 1327.41ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 95.8MB in the beginning and 114.6MB in the end (delta: -18.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,582 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:08,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.04ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 95.5MB in the beginning and 121.1MB in the end (delta: -25.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 148.9MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,589 INFO L158 Benchmark]: Boogie Preprocessor took 48.32ms. Allocated memory is still 148.9MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,590 INFO L158 Benchmark]: RCFGBuilder took 359.83ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 101.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,590 INFO L158 Benchmark]: TraceAbstraction took 575.19ms. Allocated memory is still 148.9MB. Free memory was 101.4MB in the beginning and 115.3MB in the end (delta: -13.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:08,590 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 114.6MB in the end (delta: 717.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:08,597 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.21ms. Allocated memory is still 121.6MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.04ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 95.5MB in the beginning and 121.1MB in the end (delta: -25.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 148.9MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.32ms. Allocated memory is still 148.9MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.83ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 101.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 575.19ms. Allocated memory is still 148.9MB. Free memory was 101.4MB in the beginning and 115.3MB in the end (delta: -13.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 114.6MB in the end (delta: 717.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 93]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of shiftRight at line 36, overapproximation of bitwiseAnd at line 37. Possible FailurePath: [L88] double x = 0.0; [L89] CALL, EXPR round_double(x) [L20] __int32_t msw, exponent_less_1023; [L21] __uint32_t lsw; VAL [\old(x)=0, x=0] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=0, exponent_less_1023=0, lsw=0, msw=9, x=0] [L29] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=0, exponent_less_1023=0, lsw=0, msw=9, x=0] [L30] COND FALSE !(exponent_less_1023 < 0) [L36] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=0, exponent_less_1023=0, exponent_mask=7, lsw=0, msw=9, x=0] [L37] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L38] return x; VAL [\old(x)=0, \result=0, exponent_less_1023=0, exponent_mask=7, lsw=0, msw=9, x=0] [L89] RET, EXPR round_double(x) [L89] double res = round_double(x); [L92] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L92] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L93] reach_error() VAL [res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 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, 38 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, 38 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=30occurred 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.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 03:03:08,644 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_1032a.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 1d77f189616851dfc2a9becddf3926b3a4d1b6826934ea34b3559c7d217e0a16 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:10,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:10,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:10,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:10,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:10,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:10,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:10,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:10,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:10,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:10,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:10,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:10,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:10,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:10,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:10,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:10,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:10,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:10,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:10,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:10,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:10,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:10,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:10,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:10,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:10,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:10,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:10,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:10,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:10,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:10,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:10,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:10,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:10,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:10,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:10,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:10,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:10,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:10,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:10,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:10,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:10,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:10,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:03:10,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:10,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:10,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:10,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:10,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:10,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:10,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:10,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:10,835 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:10,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:10,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:10,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:03:10,837 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:10,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:10,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:10,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:10,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:10,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:10,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:10,839 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:03:10,840 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:03:10,840 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:10,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:10,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:10,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:03:10,841 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 -> 1d77f189616851dfc2a9becddf3926b3a4d1b6826934ea34b3559c7d217e0a16 [2022-07-12 03:03:11,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:11,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:11,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:11,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:11,130 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:11,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1032a.c [2022-07-12 03:03:11,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d500670d/5a81c0d3252c425caab511a5a833b47f/FLAGfc94f46de [2022-07-12 03:03:11,622 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:11,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032a.c [2022-07-12 03:03:11,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d500670d/5a81c0d3252c425caab511a5a833b47f/FLAGfc94f46de [2022-07-12 03:03:12,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d500670d/5a81c0d3252c425caab511a5a833b47f [2022-07-12 03:03:12,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:12,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:12,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:12,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:12,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:12,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2deee191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12, skipping insertion in model container [2022-07-12 03:03:12,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:12,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:12,352 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_1032a.c[2282,2295] [2022-07-12 03:03:12,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:12,388 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:12,419 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_1032a.c[2282,2295] [2022-07-12 03:03:12,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:12,432 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:12,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12 WrapperNode [2022-07-12 03:03:12,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:12,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:12,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:12,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:12,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,480 INFO L137 Inliner]: procedures = 20, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-07-12 03:03:12,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:12,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:12,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:12,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:12,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:12,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:12,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:12,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:12,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (1/1) ... [2022-07-12 03:03:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:12,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:12,540 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 03:03:12,553 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 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:03:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:12,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:03:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:12,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:12,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:12,934 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:12,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:12,938 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:12,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:12 BoogieIcfgContainer [2022-07-12 03:03:12,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:12,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:12,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:12,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:12,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:12" (1/3) ... [2022-07-12 03:03:12,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14deb24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:12, skipping insertion in model container [2022-07-12 03:03:12,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:12" (2/3) ... [2022-07-12 03:03:12,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14deb24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:12, skipping insertion in model container [2022-07-12 03:03:12,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:12" (3/3) ... [2022-07-12 03:03:12,947 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032a.c [2022-07-12 03:03:12,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:12,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:13,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:13,011 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@6afff529, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a76e387 [2022-07-12 03:03:13,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 03:03:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:03:13,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:13,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:13,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2068179301, now seen corresponding path program 1 times [2022-07-12 03:03:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183302462] [2022-07-12 03:03:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:13,043 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 03:03:13,051 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 03:03:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:13,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:03:13,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:13,142 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 03:03:13,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:13,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:13,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183302462] [2022-07-12 03:03:13,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183302462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:13,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:13,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226938811] [2022-07-12 03:03:13,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:13,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:13,181 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 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 03:03:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:13,204 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2022-07-12 03:03:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:13,208 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 03:03:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:13,214 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:03:13,214 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:03:13,219 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 03:03:13,223 INFO L413 NwaCegarLoop]: 38 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, 38 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 03:03:13,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:03:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:03:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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 03:03:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-12 03:03:13,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2022-07-12 03:03:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:13,263 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-12 03:03:13,263 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 03:03:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-07-12 03:03:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:13,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:13,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:13,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:13,473 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 03:03:13,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1606867070, now seen corresponding path program 1 times [2022-07-12 03:03:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:13,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930814909] [2022-07-12 03:03:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:13,482 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 03:03:13,485 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 03:03:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:13,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:13,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:13,650 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 03:03:13,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:13,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:13,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930814909] [2022-07-12 03:03:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930814909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:13,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764316569] [2022-07-12 03:03:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:13,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:13,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:13,653 INFO L87 Difference]: Start difference. First operand 27 states and 35 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 03:03:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:13,885 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-12 03:03:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:13,886 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 03:03:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:13,886 INFO L225 Difference]: With dead ends: 39 [2022-07-12 03:03:13,886 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:03:13,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:03:13,888 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:13,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-12 03:03:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:03:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:03:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 03:03:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-12 03:03:13,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 12 [2022-07-12 03:03:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:13,892 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-12 03:03:13,892 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 03:03:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-12 03:03:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:13,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:13,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:13,903 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 03:03:14,101 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 03:03:14,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash -504714538, now seen corresponding path program 1 times [2022-07-12 03:03:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:14,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488129116] [2022-07-12 03:03:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:14,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:14,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:14,106 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 03:03:14,111 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 03:03:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:14,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:14,237 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 03:03:14,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:14,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488129116] [2022-07-12 03:03:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488129116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:14,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:14,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318133036] [2022-07-12 03:03:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:14,241 INFO L87 Difference]: Start difference. First operand 26 states and 32 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 03:03:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:14,268 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-07-12 03:03:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:14,268 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 03:03:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:14,269 INFO L225 Difference]: With dead ends: 38 [2022-07-12 03:03:14,269 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 03:03:14,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:03:14,270 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:14,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-07-12 03:03:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 03:03:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 03:03:14,272 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 03:03:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-12 03:03:14,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2022-07-12 03:03:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:14,273 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-12 03:03:14,273 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 03:03:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-12 03:03:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:03:14,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:14,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:14,284 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 03:03:14,482 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 03:03:14,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1962860917, now seen corresponding path program 1 times [2022-07-12 03:03:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499232072] [2022-07-12 03:03:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:14,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:14,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:14,493 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 03:03:14,500 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 03:03:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:14,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:14,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:14,626 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 03:03:14,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:14,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:14,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499232072] [2022-07-12 03:03:14,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499232072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:14,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:14,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902372866] [2022-07-12 03:03:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:14,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:14,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:14,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:14,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:14,628 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 03:03:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:14,656 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 03:03:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:14,657 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 03:03:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:14,657 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:03:14,657 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 03:03:14,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:03:14,659 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:14,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-12 03:03:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 03:03:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 03:03:14,661 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 03:03:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-07-12 03:03:14,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2022-07-12 03:03:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:14,661 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-07-12 03:03:14,661 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 03:03:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-07-12 03:03:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:03:14,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:14,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:14,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:14,872 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 03:03:14,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1282802547, now seen corresponding path program 1 times [2022-07-12 03:03:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537168401] [2022-07-12 03:03:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:14,876 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 03:03:14,877 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 03:03:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:14,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:03:14,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:15,034 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 03:03:15,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:15,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:15,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537168401] [2022-07-12 03:03:15,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537168401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:15,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:15,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:03:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972896520] [2022-07-12 03:03:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:03:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:03:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:03:15,036 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 03:03:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:15,046 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-07-12 03:03:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:03:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 03:03:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:15,047 INFO L225 Difference]: With dead ends: 24 [2022-07-12 03:03:15,047 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 03:03:15,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:03:15,048 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:15,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-07-12 03:03:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 03:03:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 03:03:15,050 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 03:03:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-07-12 03:03:15,050 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2022-07-12 03:03:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:15,051 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-07-12 03:03:15,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 03:03:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-07-12 03:03:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:03:15,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:15,051 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 03:03:15,063 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 03:03:15,260 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 03:03:15,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 218634850, now seen corresponding path program 1 times [2022-07-12 03:03:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:15,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976104223] [2022-07-12 03:03:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:15,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:15,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:15,263 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 03:03:15,264 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 03:03:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:15,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 03:03:15,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:15,381 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 03:03:15,491 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:03:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-12 03:03:15,679 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:03:15,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 29 [2022-07-12 03:03:15,816 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 03:03:15,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:15,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:15,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976104223] [2022-07-12 03:03:15,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976104223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:15,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:15,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 03:03:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272017788] [2022-07-12 03:03:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:15,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:03:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:03:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:03:15,818 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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 03:03:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:15,862 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-07-12 03:03:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:03:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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 03:03:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:15,863 INFO L225 Difference]: With dead ends: 21 [2022-07-12 03:03:15,863 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:03:15,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:03:15,864 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:15,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-12 03:03:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:03:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:03:15,864 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 03:03:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:03:15,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-07-12 03:03:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:15,865 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:03:15,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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 03:03:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:03:15,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:03:15,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:15,893 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 03:03:16,076 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 03:03:16,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:03:16,105 INFO L902 garLoopResultBuilder]: At program point L97(lines 80 98) the Hoare annotation is: true [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L895 garLoopResultBuilder]: At program point L77(lines 68 78) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short10#1| (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 47) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L895 garLoopResultBuilder]: At program point L65(lines 19 66) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_14| (_ BitVec 64)) (|v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9|))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13|) (_ bv4 32))) (.cse1 (select .cse3 (_ bv4 32)))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_14|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_14|) .cse0) (= .cse1 .cse0) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_round_double_#res#1|))))) (exists ((|v_ULTIMATE.start_round_double_~msw~0#1_16| (_ BitVec 32))) (= |ULTIMATE.start_round_double_#res#1| (let ((.cse4 (concat (bvand |v_ULTIMATE.start_round_double_~msw~0#1_16| (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 33) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 58) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 55) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 55) no Hoare annotation was computed. [2022-07-12 03:03:16,106 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 71 75) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L895 garLoopResultBuilder]: At program point L71-2(lines 71 75) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short10#1| (exists ((|v_skolemized_q#valueAsBitvector_14| (_ BitVec 64)) (|v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9|))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13|) (_ bv4 32))) (.cse1 (select .cse3 (_ bv4 32)))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_14|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_14|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_14|) .cse0) (= .cse1 .cse0) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start___signbit_double_~x#1|)))))) [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L71-3(lines 71 75) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 42) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 19 66) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 95) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 64) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: (= (_ +zero 11 53) |ULTIMATE.start_round_double_~x#1|) [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 52) no Hoare annotation was computed. [2022-07-12 03:03:16,107 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 58) no Hoare annotation was computed. [2022-07-12 03:03:16,109 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 03:03:16,111 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:16,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,134 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:16 BoogieIcfgContainer [2022-07-12 03:03:16,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:16,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:16,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:16,137 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:16,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:12" (3/4) ... [2022-07-12 03:03:16,139 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:03:16,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-12 03:03:16,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 03:03:16,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:03:16,147 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:03:16,162 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_14 : bv64, v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13 : bv32 :: ((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_14[63:63], v_skolemized_q#valueAsBitvector_14[62:52], v_skolemized_q#valueAsBitvector_14[51:0]) && v_skolemized_q#valueAsBitvector_14[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == \result) && (\exists v_ULTIMATE.start_round_double_~msw~0#1_16 : bv32 :: \result == ~fp~LONGDOUBLE((~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[63:63], (~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[62:52], (~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[51:0])) [2022-07-12 03:03:16,163 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == 0.0 && __signbit_double(res) == 0-aux && (\exists v_skolemized_q#valueAsBitvector_14 : bv64, v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13 : bv32 :: ((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_14[63:63], v_skolemized_q#valueAsBitvector_14[62:52], v_skolemized_q#valueAsBitvector_14[51:0]) && v_skolemized_q#valueAsBitvector_14[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == x) [2022-07-12 03:03:16,163 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result [2022-07-12 03:03:16,170 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:03:16,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:16,170 INFO L158 Benchmark]: Toolchain (without parser) took 4116.95ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 69.8MB in the beginning and 51.4MB in the end (delta: 18.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,170 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.54ms. Allocated memory is still 86.0MB. Free memory was 69.6MB in the beginning and 67.8MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.67ms. Allocated memory is still 86.0MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: Boogie Preprocessor took 25.55ms. Allocated memory is still 86.0MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: RCFGBuilder took 429.60ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 51.6MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: TraceAbstraction took 3195.39ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 55.0MB in the end (delta: -4.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,171 INFO L158 Benchmark]: Witness Printer took 33.02ms. Allocated memory is still 104.9MB. Free memory was 55.0MB in the beginning and 51.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:03:16,172 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.21ms. Allocated memory is still 86.0MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.54ms. Allocated memory is still 86.0MB. Free memory was 69.6MB in the beginning and 67.8MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.67ms. Allocated memory is still 86.0MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.55ms. Allocated memory is still 86.0MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 429.60ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 51.6MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3195.39ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 55.0MB in the end (delta: -4.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 33.02ms. Allocated memory is still 104.9MB. Free memory was 55.0MB in the beginning and 51.4MB in the end (delta: 3.7MB). 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[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,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: 93]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 81 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 124 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 172 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 81 ConstructedInterpolants, 32 QuantifiedInterpolants, 968 SizeOfPredicates, 37 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 71]: Loop Invariant [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] Derived loop invariant: aux-res == 0.0 && __signbit_double(res) == 0-aux && (\exists v_skolemized_q#valueAsBitvector_14 : bv64, v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13 : bv32 :: ((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_14[63:63], v_skolemized_q#valueAsBitvector_14[62:52], v_skolemized_q#valueAsBitvector_14[51:0]) && v_skolemized_q#valueAsBitvector_14[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == x) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result - InvariantResult [Line: 19]: Loop Invariant [2022-07-12 03:03:16,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_14,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] [2022-07-12 03:03:16,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_double_~msw~0#1_16,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_14 : bv64, v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13 : bv32 :: ((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_14[63:63], v_skolemized_q#valueAsBitvector_14[62:52], v_skolemized_q#valueAsBitvector_14[51:0]) && v_skolemized_q#valueAsBitvector_14[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#ew_u~0#1.base_13][4bv32]) && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_round_double_~#iw_u~0#1.base_9][0bv32])[51:0]) == \result) && (\exists v_ULTIMATE.start_round_double_~msw~0#1_16 : bv32 :: \result == ~fp~LONGDOUBLE((~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[63:63], (~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[62:52], (~bvand32(v_ULTIMATE.start_round_double_~msw~0#1_16, 2147483648bv32) ++ 0bv32)[51:0])) RESULT: Ultimate proved your program to be correct! [2022-07-12 03:03:16,224 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