./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_1052c.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 dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:42:18,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:42:18,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:42:18,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:42:18,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:42:18,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:42:18,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:42:18,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:42:18,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:42:18,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:42:18,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:42:18,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:42:18,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:42:18,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:42:18,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:42:18,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:42:18,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:42:18,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:42:18,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:42:18,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:42:18,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:42:18,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:42:18,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:42:18,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:42:18,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:42:18,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:42:18,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:42:18,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:42:18,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:42:18,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:42:18,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:42:18,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:42:18,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:42:18,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:42:18,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:42:18,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:42:18,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:42:18,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:42:18,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:42:18,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:42:18,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:42:18,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:42:18,378 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:42:18,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:42:18,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:42:18,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:42:18,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:42:18,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:42:18,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:42:18,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:42:18,380 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:42:18,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:42:18,381 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:42:18,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:42:18,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:42:18,382 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:42:18,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:42:18,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:42:18,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:42:18,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:42:18,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:42:18,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:42:18,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:42:18,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:42:18,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:42:18,385 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 -> dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 [2021-12-17 07:42:18,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:42:18,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:42:18,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:42:18,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:42:18,588 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:42:18,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-17 07:42:18,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd152453c/3742ad468df94d41ade5f660548bdfec/FLAG33e906dd2 [2021-12-17 07:42:19,095 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:42:19,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-17 07:42:19,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd152453c/3742ad468df94d41ade5f660548bdfec/FLAG33e906dd2 [2021-12-17 07:42:19,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd152453c/3742ad468df94d41ade5f660548bdfec [2021-12-17 07:42:19,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:42:19,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:42:19,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:42:19,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:42:19,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:42:19,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b432b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19, skipping insertion in model container [2021-12-17 07:42:19,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:42:19,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:42:19,338 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_1052c.c[2271,2284] [2021-12-17 07:42:19,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:42:19,347 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:42:19,381 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_1052c.c[2271,2284] [2021-12-17 07:42:19,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:42:19,394 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:42:19,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19 WrapperNode [2021-12-17 07:42:19,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:42:19,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:42:19,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:42:19,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:42:19,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,432 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-17 07:42:19,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:42:19,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:42:19,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:42:19,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:42:19,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:42:19,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:42:19,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:42:19,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:42:19,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (1/1) ... [2021-12-17 07:42:19,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:42:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:42:19,501 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) [2021-12-17 07:42:19,517 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 [2021-12-17 07:42:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-17 07:42:19,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:42:19,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:42:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 07:42:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:42:19,622 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:42:19,647 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:42:19,833 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:42:19,837 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:42:19,839 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 07:42:19,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:19 BoogieIcfgContainer [2021-12-17 07:42:19,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:42:19,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:42:19,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:42:19,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:42:19,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:42:19" (1/3) ... [2021-12-17 07:42:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a32280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:42:19, skipping insertion in model container [2021-12-17 07:42:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:19" (2/3) ... [2021-12-17 07:42:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a32280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:42:19, skipping insertion in model container [2021-12-17 07:42:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:19" (3/3) ... [2021-12-17 07:42:19,848 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2021-12-17 07:42:19,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:42:19,852 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:42:19,891 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:42:19,898 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:42:19,898 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:42:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:42:19,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:19,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:19,914 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2021-12-17 07:42:19,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:42:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334112881] [2021-12-17 07:42:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:19,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:42:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:20,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:42:20,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334112881] [2021-12-17 07:42:20,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334112881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:20,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:20,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:42:20,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725039690] [2021-12-17 07:42:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:20,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:42:20,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:42:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:42:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:42:20,093 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:20,110 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2021-12-17 07:42:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:42:20,112 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 [2021-12-17 07:42:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:20,117 INFO L225 Difference]: With dead ends: 74 [2021-12-17 07:42:20,117 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 07:42:20,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:42:20,123 INFO L933 BasicCegarLoop]: 53 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, 53 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 [2021-12-17 07:42:20,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:42:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 07:42:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-17 07:42:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-12-17 07:42:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2021-12-17 07:42:20,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2021-12-17 07:42:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:20,148 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2021-12-17 07:42:20,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2021-12-17 07:42:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:42:20,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:20,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:20,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:42:20,151 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2021-12-17 07:42:20,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:42:20,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711088940] [2021-12-17 07:42:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:20,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:42:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:42:20,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:42:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:42:20,246 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:42:20,248 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:42:20,250 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:42:20,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:42:20,253 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 07:42:20,256 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:42:20,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:42:20 BoogieIcfgContainer [2021-12-17 07:42:20,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:42:20,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:42:20,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:42:20,282 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:42:20,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:19" (3/4) ... [2021-12-17 07:42:20,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:42:20,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:42:20,286 INFO L158 Benchmark]: Toolchain (without parser) took 1158.35ms. Allocated memory is still 90.2MB. Free memory was 60.3MB in the beginning and 53.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2021-12-17 07:42:20,286 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:42:20,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 66.1MB in the end (delta: -6.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2021-12-17 07:42:20,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 64.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:42:20,290 INFO L158 Benchmark]: Boogie Preprocessor took 44.32ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 62.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:42:20,291 INFO L158 Benchmark]: RCFGBuilder took 361.97ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 49.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 07:42:20,292 INFO L158 Benchmark]: TraceAbstraction took 440.00ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 53.5MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:42:20,292 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 90.2MB. Free memory was 53.5MB in the beginning and 53.1MB in the end (delta: 450.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:42:20,296 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.16ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 66.1MB in the end (delta: -6.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 64.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.32ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 62.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.97ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 49.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 440.00ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 53.5MB in the end (delta: -4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 90.2MB. Free memory was 53.5MB in the beginning and 53.1MB in the end (delta: 450.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 105]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftRight at line 39, overapproximation of bitwiseOr at line 40, overapproximation of someUnaryDOUBLEoperation at line 100, overapproximation of bitwiseAnd at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L16] static const double huge_floor = 1.0e300; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L100] double x = -0.0; [L101] CALL, EXPR floor_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (i0) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (i1) = ew_u.parts.lsw [L27] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1, i1=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L40] COND TRUE ((i0 & i) | i1) == 0 [L41] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L101] RET, EXPR floor_double(x) [L101] double res = floor_double(x); [L104] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, res == -0.0 && __signbit_double(res) == 1=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L104] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L105] reach_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 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, 53 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=38occurred 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.0s SatisfiabilityAnalysisTime, 0.1s 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 [2021-12-17 07:42:20,332 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_1052c.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 dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:42:22,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:42:22,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:42:22,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:42:22,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:42:22,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:42:22,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:42:22,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:42:22,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:42:22,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:42:22,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:42:22,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:42:22,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:42:22,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:42:22,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:42:22,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:42:22,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:42:22,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:42:22,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:42:22,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:42:22,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:42:22,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:42:22,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:42:22,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:42:22,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:42:22,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:42:22,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:42:22,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:42:22,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:42:22,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:42:22,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:42:22,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:42:22,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:42:22,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:42:22,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:42:22,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:42:22,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:42:22,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:42:22,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:42:22,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:42:22,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:42:22,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:42:22,275 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:42:22,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:42:22,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:42:22,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:42:22,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:42:22,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:42:22,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:42:22,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:42:22,277 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:42:22,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:42:22,278 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:42:22,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:42:22,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:42:22,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:42:22,279 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:42:22,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:42:22,280 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:42:22,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:42:22,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:42:22,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:42:22,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:42:22,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:42:22,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:42:22,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:42:22,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:42:22,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:42:22,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:42:22,283 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 -> dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 [2021-12-17 07:42:22,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:42:22,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:42:22,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:42:22,594 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:42:22,595 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:42:22,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-17 07:42:22,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6c753ec/749d342882ff4b6ebd014c97ed2e648e/FLAGa149c8d02 [2021-12-17 07:42:23,041 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:42:23,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-17 07:42:23,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6c753ec/749d342882ff4b6ebd014c97ed2e648e/FLAGa149c8d02 [2021-12-17 07:42:23,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6c753ec/749d342882ff4b6ebd014c97ed2e648e [2021-12-17 07:42:23,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:42:23,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:42:23,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:42:23,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:42:23,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:42:23,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b593ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23, skipping insertion in model container [2021-12-17 07:42:23,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:42:23,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:42:23,270 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_1052c.c[2271,2284] [2021-12-17 07:42:23,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:42:23,298 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:42:23,354 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_1052c.c[2271,2284] [2021-12-17 07:42:23,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:42:23,382 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:42:23,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23 WrapperNode [2021-12-17 07:42:23,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:42:23,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:42:23,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:42:23,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:42:23,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,452 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-17 07:42:23,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:42:23,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:42:23,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:42:23,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:42:23,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:42:23,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:42:23,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:42:23,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:42:23,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (1/1) ... [2021-12-17 07:42:23,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:42:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:42:23,549 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) [2021-12-17 07:42:23,576 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 [2021-12-17 07:42:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:42:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2021-12-17 07:42:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-17 07:42:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:42:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:42:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 07:42:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:42:23,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:42:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 07:42:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:42:23,681 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:42:23,682 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:42:24,678 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:42:24,681 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:42:24,682 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 07:42:24,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:24 BoogieIcfgContainer [2021-12-17 07:42:24,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:42:24,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:42:24,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:42:24,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:42:24,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:42:23" (1/3) ... [2021-12-17 07:42:24,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398a0327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:42:24, skipping insertion in model container [2021-12-17 07:42:24,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:42:23" (2/3) ... [2021-12-17 07:42:24,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398a0327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:42:24, skipping insertion in model container [2021-12-17 07:42:24,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:24" (3/3) ... [2021-12-17 07:42:24,688 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2021-12-17 07:42:24,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:42:24,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:42:24,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:42:24,723 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:42:24,724 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:42:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:42:24,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:24,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:24,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2021-12-17 07:42:24,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:24,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62257429] [2021-12-17 07:42:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:24,748 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:24,750 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) [2021-12-17 07:42:24,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:42:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:24,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:42:24,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:24,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:24,905 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:24,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62257429] [2021-12-17 07:42:24,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62257429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:24,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:24,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:42:24,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510366760] [2021-12-17 07:42:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:24,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:42:24,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:42:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:42:24,943 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:24,965 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2021-12-17 07:42:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:42:24,967 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 [2021-12-17 07:42:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:24,975 INFO L225 Difference]: With dead ends: 74 [2021-12-17 07:42:24,976 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 07:42:24,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:42:24,983 INFO L933 BasicCegarLoop]: 53 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, 53 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 [2021-12-17 07:42:24,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:42:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 07:42:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-17 07:42:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-12-17 07:42:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2021-12-17 07:42:25,018 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2021-12-17 07:42:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:25,019 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2021-12-17 07:42:25,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2021-12-17 07:42:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:42:25,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:25,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:25,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:25,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:25,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2021-12-17 07:42:25,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:25,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310332810] [2021-12-17 07:42:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:25,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:25,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:25,258 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) [2021-12-17 07:42:25,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:42:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:25,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 07:42:25,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:25,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:25,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:25,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310332810] [2021-12-17 07:42:25,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310332810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:25,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:25,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:42:25,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810396127] [2021-12-17 07:42:25,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:25,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:42:25,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:42:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:42:25,443 INFO L87 Difference]: Start difference. First operand 35 states and 50 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) [2021-12-17 07:42:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:26,109 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2021-12-17 07:42:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:42:26,110 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 [2021-12-17 07:42:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:26,110 INFO L225 Difference]: With dead ends: 47 [2021-12-17 07:42:26,110 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 07:42:26,111 INFO L932 BasicCegarLoop]: 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 [2021-12-17 07:42:26,111 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:26,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 22 Unchecked, 0.6s Time] [2021-12-17 07:42:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 07:42:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-17 07:42:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 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) [2021-12-17 07:42:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-17 07:42:26,119 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2021-12-17 07:42:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:26,119 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-17 07:42:26,119 INFO L471 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) [2021-12-17 07:42:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-12-17 07:42:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:42:26,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:26,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:26,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:26,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:26,321 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1803079892, now seen corresponding path program 1 times [2021-12-17 07:42:26,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:26,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780445618] [2021-12-17 07:42:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:26,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:26,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:26,324 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) [2021-12-17 07:42:26,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:42:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:26,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 07:42:26,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:26,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:26,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780445618] [2021-12-17 07:42:26,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780445618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:26,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:26,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:42:26,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77726867] [2021-12-17 07:42:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:26,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:42:26,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:42:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:42:26,490 INFO L87 Difference]: Start difference. First operand 31 states and 42 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) [2021-12-17 07:42:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:26,799 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2021-12-17 07:42:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:42:26,799 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 [2021-12-17 07:42:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:26,800 INFO L225 Difference]: With dead ends: 43 [2021-12-17 07:42:26,800 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 07:42:26,800 INFO L932 BasicCegarLoop]: 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 [2021-12-17 07:42:26,801 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:26,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2021-12-17 07:42:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 07:42:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 07:42:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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) [2021-12-17 07:42:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-17 07:42:26,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2021-12-17 07:42:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:26,803 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-17 07:42:26,803 INFO L471 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) [2021-12-17 07:42:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-17 07:42:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 07:42:26,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:26,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:26,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 07:42:27,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2021-12-17 07:42:27,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:27,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557835001] [2021-12-17 07:42:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:27,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:27,011 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) [2021-12-17 07:42:27,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:42:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:27,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 07:42:27,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:27,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:27,243 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:27,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557835001] [2021-12-17 07:42:27,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557835001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:27,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:27,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:42:27,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567338519] [2021-12-17 07:42:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:27,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 07:42:27,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 07:42:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 07:42:27,245 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-12-17 07:42:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:27,299 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-17 07:42:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 07:42:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-12-17 07:42:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:27,304 INFO L225 Difference]: With dead ends: 34 [2021-12-17 07:42:27,304 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 07:42:27,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 07:42:27,305 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:27,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 07:42:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 07:42:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 07:42:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 07:42:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-17 07:42:27,307 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-12-17 07:42:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:27,307 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-17 07:42:27,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-12-17 07:42:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-17 07:42:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 07:42:27,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:27,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:27,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:27,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,518 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2021-12-17 07:42:27,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324073471] [2021-12-17 07:42:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:27,519 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:27,523 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) [2021-12-17 07:42:27,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 07:42:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:27,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:42:27,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:27,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:27,714 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324073471] [2021-12-17 07:42:27,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324073471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:27,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:27,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 07:42:27,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253056901] [2021-12-17 07:42:27,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:27,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 07:42:27,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 07:42:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 07:42:27,716 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2021-12-17 07:42:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:27,744 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-12-17 07:42:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:42:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 [2021-12-17 07:42:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:27,746 INFO L225 Difference]: With dead ends: 34 [2021-12-17 07:42:27,746 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 07:42:27,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:42:27,747 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:27,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2021-12-17 07:42:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 07:42:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 07:42:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:42:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-17 07:42:27,750 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2021-12-17 07:42:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:27,750 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-17 07:42:27,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2021-12-17 07:42:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-12-17 07:42:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 07:42:27,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:27,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:27,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:27,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,964 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 461150674, now seen corresponding path program 1 times [2021-12-17 07:42:27,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994160804] [2021-12-17 07:42:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:27,966 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:27,967 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) [2021-12-17 07:42:27,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 07:42:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:28,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 07:42:28,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:28,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-12-17 07:42:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:28,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:28,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:28,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994160804] [2021-12-17 07:42:28,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994160804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:28,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:28,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 07:42:28,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743054600] [2021-12-17 07:42:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:28,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 07:42:28,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 07:42:28,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 07:42:28,240 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-17 07:42:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:28,281 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-17 07:42:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:42:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-12-17 07:42:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:28,284 INFO L225 Difference]: With dead ends: 34 [2021-12-17 07:42:28,284 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 07:42:28,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:42:28,285 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:28,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2021-12-17 07:42:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 07:42:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 07:42:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 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) [2021-12-17 07:42:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2021-12-17 07:42:28,287 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2021-12-17 07:42:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:28,287 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2021-12-17 07:42:28,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-17 07:42:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2021-12-17 07:42:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 07:42:28,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:28,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:28,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:28,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:28,489 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -348195952, now seen corresponding path program 1 times [2021-12-17 07:42:28,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:28,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306833123] [2021-12-17 07:42:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:28,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:28,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:42:28,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 07:42:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:28,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 07:42:28,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:28,646 INFO L388 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 [2021-12-17 07:42:28,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 07:42:28,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 69 [2021-12-17 07:42:29,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-12-17 07:42:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:29,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:29,160 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:29,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306833123] [2021-12-17 07:42:29,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306833123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:29,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:29,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 07:42:29,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750462751] [2021-12-17 07:42:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:29,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:42:29,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:42:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:42:29,161 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-12-17 07:42:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:29,244 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2021-12-17 07:42:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:42:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2021-12-17 07:42:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:29,260 INFO L225 Difference]: With dead ends: 25 [2021-12-17 07:42:29,260 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 07:42:29,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:42:29,260 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:29,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2021-12-17 07:42:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 07:42:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 07:42:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 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) [2021-12-17 07:42:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2021-12-17 07:42:29,262 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2021-12-17 07:42:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:29,263 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2021-12-17 07:42:29,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2021-12-17 07:42:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2021-12-17 07:42:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 07:42:29,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:42:29,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:29,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:29,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:29,464 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:42:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:42:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -475618843, now seen corresponding path program 1 times [2021-12-17 07:42:29,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:42:29,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051524731] [2021-12-17 07:42:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:42:29,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:42:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:42:29,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:42:29,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 07:42:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:42:29,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 07:42:29,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:42:29,638 INFO L388 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 [2021-12-17 07:42:29,822 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 07:42:29,822 INFO L388 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 [2021-12-17 07:42:30,108 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 07:42:30,108 INFO L388 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 62 treesize of output 30 [2021-12-17 07:42:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:42:30,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:42:30,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:42:30,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051524731] [2021-12-17 07:42:30,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051524731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:42:30,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:42:30,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 07:42:30,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844674851] [2021-12-17 07:42:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:42:30,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 07:42:30,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:42:30,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 07:42:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-17 07:42:30,317 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2021-12-17 07:42:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:42:30,344 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-12-17 07:42:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 07:42:30,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) Word has length 21 [2021-12-17 07:42:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:42:30,345 INFO L225 Difference]: With dead ends: 22 [2021-12-17 07:42:30,345 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 07:42:30,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-17 07:42:30,345 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:42:30,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-12-17 07:42:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 07:42:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 07:42:30,346 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) [2021-12-17 07:42:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 07:42:30,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-12-17 07:42:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:42:30,346 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 07:42:30,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2021-12-17 07:42:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 07:42:30,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 07:42:30,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:42:30,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 07:42:30,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:42:30,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 07:42:30,626 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-12-17 07:42:30,626 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 07:42:30,626 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 07:42:30,626 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2021-12-17 07:42:30,626 INFO L854 garLoopResultBuilder]: At program point L78(lines 18 79) the Hoare annotation is: (let ((.cse4 (fp.neg (_ +zero 11 53)))) (and (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11|))) (let ((.cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|)) (.cse1 (select .cse3 (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_18|)) (fp.neg (_ +zero 11 53))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse0) (= .cse1 .cse0) (= |ULTIMATE.start_floor_double_#res#1| (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))))) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= |ULTIMATE.start_floor_double_~x#1| .cse4) (= |ULTIMATE.start_floor_double_#res#1| .cse4))) [2021-12-17 07:42:30,626 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= |ULTIMATE.start_floor_double_~x#1| (fp.neg (_ +zero 11 53)))) [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L104-2(lines 104 107) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 07:42:30,627 INFO L854 garLoopResultBuilder]: At program point L90(lines 81 91) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_18|)) (fp.neg (_ +zero 11 53))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) (let ((.cse0 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|) v_arrayElimCell_8))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= |ULTIMATE.start___signbit_double_#res#1| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse1) (= |ULTIMATE.start_floor_double_#res#1| .cse1))) [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 88) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 88) the Hoare annotation is: (let ((.cse4 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11|))) (let ((.cse2 (select .cse3 (_ bv4 32))) (.cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_18|)) (fp.neg (_ +zero 11 53))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse0) (= |ULTIMATE.start___signbit_double_~x#1| (let ((.cse1 (concat .cse2 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (= .cse2 .cse0))))) (= currentRoundingMode roundNearestTiesToEven) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse4) (= |ULTIMATE.start_floor_double_#res#1| .cse4))) [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L861 garLoopResultBuilder]: At program point L109(lines 93 110) the Hoare annotation is: true [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2021-12-17 07:42:30,628 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2021-12-17 07:42:30,630 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:42:30,631 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:42:30,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,637 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,645 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:42:30 BoogieIcfgContainer [2021-12-17 07:42:30,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:42:30,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:42:30,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:42:30,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:42:30,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:42:24" (3/4) ... [2021-12-17 07:42:30,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 07:42:30,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-12-17 07:42:30,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-17 07:42:30,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 07:42:30,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 07:42:30,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && \result == ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]))) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2021-12-17 07:42:30,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && x == ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0])) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2021-12-17 07:42:30,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists v_skolemized_q#valueAsBitvector_18 : bv64, v_skolemized_q#valueAsBitvector_19 : bv64, v_arrayElimCell_8 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_19[63:63], v_skolemized_q#valueAsBitvector_19[62:52], v_skolemized_q#valueAsBitvector_19[51:0]) == ~fp~LONGDOUBLE((v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[63:63], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[62:52], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[51:0])) && \result == 1bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2021-12-17 07:42:30,684 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 07:42:30,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:42:30,684 INFO L158 Benchmark]: Toolchain (without parser) took 7625.98ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 36.1MB in the end (delta: 3.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 44.0MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.05ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 37.8MB in the end (delta: 1.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.71ms. Allocated memory is still 56.6MB. Free memory was 37.8MB in the beginning and 35.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: Boogie Preprocessor took 71.12ms. Allocated memory is still 56.6MB. Free memory was 35.9MB in the beginning and 34.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: RCFGBuilder took 1158.10ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 32.0MB in the end (delta: 2.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,685 INFO L158 Benchmark]: TraceAbstraction took 5966.04ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 39.7MB in the end (delta: -8.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,686 INFO L158 Benchmark]: Witness Printer took 33.34ms. Allocated memory is still 77.6MB. Free memory was 39.7MB in the beginning and 36.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:42:30,687 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.14ms. Allocated memory is still 44.0MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 35.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.05ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 37.8MB in the end (delta: 1.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.71ms. Allocated memory is still 56.6MB. Free memory was 37.8MB in the beginning and 35.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.12ms. Allocated memory is still 56.6MB. Free memory was 35.9MB in the beginning and 34.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.10ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 32.0MB in the end (delta: 2.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5966.04ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 39.7MB in the end (delta: -8.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 33.34ms. Allocated memory is still 77.6MB. Free memory was 39.7MB in the beginning and 36.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 105]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 193 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 240 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 44 QuantifiedInterpolants, 1436 SizeOfPredicates, 47 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant [2021-12-17 07:42:30,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && x == ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0])) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 81]: Loop Invariant [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-17 07:42:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((\exists v_skolemized_q#valueAsBitvector_18 : bv64, v_skolemized_q#valueAsBitvector_19 : bv64, v_arrayElimCell_8 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_19[63:63], v_skolemized_q#valueAsBitvector_19[62:52], v_skolemized_q#valueAsBitvector_19[51:0]) == ~fp~LONGDOUBLE((v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[63:63], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[62:52], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[51:0])) && \result == 1bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] Derived loop invariant: (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && \result == ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]))) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:42:30,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) RESULT: Ultimate proved your program to be correct! [2021-12-17 07:42:30,734 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