./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 eb692b52 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-?-eb692b5 [2022-07-19 14:12:12,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:12:12,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:12:12,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:12:12,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:12:12,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:12:12,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:12:12,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:12:12,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:12:12,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:12:12,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:12:12,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:12:12,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:12:12,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:12:12,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:12:12,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:12:12,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:12:12,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:12:12,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:12:12,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:12:12,357 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:12:12,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:12:12,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:12:12,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:12:12,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:12:12,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:12:12,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:12:12,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:12:12,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:12:12,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:12:12,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:12:12,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:12:12,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:12:12,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:12:12,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:12:12,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:12:12,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:12:12,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:12:12,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:12:12,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:12:12,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:12:12,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:12:12,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:12:12,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:12:12,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:12:12,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:12:12,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:12:12,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:12:12,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:12:12,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:12:12,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:12:12,396 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:12:12,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:12:12,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:12:12,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:12:12,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:12:12,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:12:12,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:12:12,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:12:12,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:12:12,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:12:12,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:12:12,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:12,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:12:12,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:12:12,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:12:12,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:12:12,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:12:12,400 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:12:12,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:12:12,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:12:12,401 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 [2022-07-19 14:12:12,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:12:12,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:12:12,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:12:12,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:12:12,593 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:12:12,594 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 [2022-07-19 14:12:12,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490f8661/8c467e1d919749fe93ff3cb4e8244384/FLAG488662d85 [2022-07-19 14:12:13,059 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:12:13,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-19 14:12:13,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490f8661/8c467e1d919749fe93ff3cb4e8244384/FLAG488662d85 [2022-07-19 14:12:13,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7490f8661/8c467e1d919749fe93ff3cb4e8244384 [2022-07-19 14:12:13,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:12:13,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:12:13,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:13,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:12:13,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:12:13,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55673e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13, skipping insertion in model container [2022-07-19 14:12:13,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:12:13,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:12:13,274 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] [2022-07-19 14:12:13,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:13,282 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:12:13,301 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] [2022-07-19 14:12:13,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:13,310 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:12:13,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13 WrapperNode [2022-07-19 14:12:13,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:13,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:13,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:12:13,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:12:13,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,346 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-19 14:12:13,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:13,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:12:13,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:12:13,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:12:13,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:12:13,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:12:13,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:12:13,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:12:13,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (1/1) ... [2022-07-19 14:12:13,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:12:13,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:12:13,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:12:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:12:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:12:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:12:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 14:12:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:12:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 14:12:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:12:13,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:12:13,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:12:13,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:12:13,497 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:12:13,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:12:13,780 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:12:13,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:12:13,785 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:12:13,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:13 BoogieIcfgContainer [2022-07-19 14:12:13,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:12:13,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:12:13,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:12:13,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:12:13,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:12:13" (1/3) ... [2022-07-19 14:12:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eb1f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:13, skipping insertion in model container [2022-07-19 14:12:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:13" (2/3) ... [2022-07-19 14:12:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eb1f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:13, skipping insertion in model container [2022-07-19 14:12:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:13" (3/3) ... [2022-07-19 14:12:13,796 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2022-07-19 14:12:13,838 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:12:13,838 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:12:13,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:12:13,911 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d2a87a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fa87ab6 [2022-07-19 14:12:13,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:12:13,917 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) [2022-07-19 14:12:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:12:13,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:13,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:13,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-19 14:12:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:12:13,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59409324] [2022-07-19 14:12:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:12:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:12:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59409324] [2022-07-19 14:12:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59409324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:12:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131594734] [2022-07-19 14:12:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:14,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:12:14,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:12:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:12:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:14,091 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) [2022-07-19 14:12:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:14,112 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-19 14:12:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:12:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:12:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:14,120 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:12:14,120 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:12:14,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:14,126 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:14,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:12:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:12:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-19 14:12:14,154 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) [2022-07-19 14:12:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-19 14:12:14,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-19 14:12:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:14,158 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-19 14:12:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-19 14:12:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:14,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:14,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:14,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:12:14,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-19 14:12:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:12:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984847887] [2022-07-19 14:12:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:12:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:12:14,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:12:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:12:14,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:12:14,428 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:12:14,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:12:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:12:14,437 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-19 14:12:14,440 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:12:14,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:12:14 BoogieIcfgContainer [2022-07-19 14:12:14,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:12:14,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:12:14,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:12:14,465 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:12:14,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:13" (3/4) ... [2022-07-19 14:12:14,468 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 14:12:14,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:12:14,469 INFO L158 Benchmark]: Toolchain (without parser) took 1390.29ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 65.0MB in the beginning and 73.5MB in the end (delta: -8.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,469 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:14,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.77ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 71.2MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 68.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,474 INFO L158 Benchmark]: Boogie Preprocessor took 42.53ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,475 INFO L158 Benchmark]: RCFGBuilder took 396.61ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 49.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,475 INFO L158 Benchmark]: TraceAbstraction took 676.08ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 48.5MB in the beginning and 73.5MB in the end (delta: -25.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-19 14:12:14,476 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 125.8MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:14,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.77ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 71.2MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 68.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.53ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.61ms. Allocated memory is still 96.5MB. Free memory was 66.4MB in the beginning and 49.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 676.08ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 48.5MB in the beginning and 73.5MB in the end (delta: -25.0MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 125.8MB. Free memory is still 73.5MB. 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 40, 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=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=1, i0=-1048576, 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, i=1, i0=-1048576, 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.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 14:12:14,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-?-eb692b5 [2022-07-19 14:12:16,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:12:16,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:12:16,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:12:16,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:12:16,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:12:16,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:12:16,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:12:16,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:12:16,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:12:16,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:12:16,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:12:16,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:12:16,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:12:16,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:12:16,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:12:16,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:12:16,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:12:16,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:12:16,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:12:16,303 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:12:16,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:12:16,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:12:16,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:12:16,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:12:16,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:12:16,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:12:16,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:12:16,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:12:16,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:12:16,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:12:16,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:12:16,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:12:16,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:12:16,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:12:16,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:12:16,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:12:16,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:12:16,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:12:16,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:12:16,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:12:16,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:12:16,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:12:16,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:12:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:12:16,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:12:16,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:12:16,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:12:16,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:12:16,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:12:16,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:12:16,360 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:12:16,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:12:16,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:12:16,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:12:16,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:12:16,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:12:16,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:12:16,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:12:16,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:12:16,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:12:16,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:12:16,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:12:16,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:16,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:12:16,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:12:16,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:12:16,364 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:12:16,364 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:12:16,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:12:16,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:12:16,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:12:16,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:12:16,365 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 [2022-07-19 14:12:16,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:12:16,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:12:16,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:12:16,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:12:16,682 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:12:16,683 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 [2022-07-19 14:12:16,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e90827b0/52345499c15245338b7c5aa0f9870eb7/FLAG4930f8e47 [2022-07-19 14:12:17,100 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:12:17,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-19 14:12:17,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e90827b0/52345499c15245338b7c5aa0f9870eb7/FLAG4930f8e47 [2022-07-19 14:12:17,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e90827b0/52345499c15245338b7c5aa0f9870eb7 [2022-07-19 14:12:17,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:12:17,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:12:17,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:17,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:12:17,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:12:17,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fbdb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17, skipping insertion in model container [2022-07-19 14:12:17,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:12:17,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:12:17,694 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] [2022-07-19 14:12:17,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:17,737 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:12:17,759 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] [2022-07-19 14:12:17,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:12:17,772 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:12:17,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17 WrapperNode [2022-07-19 14:12:17,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:12:17,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:17,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:12:17,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:12:17,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,800 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-19 14:12:17,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:12:17,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:12:17,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:12:17,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:12:17,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:12:17,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:12:17,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:12:17,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:12:17,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (1/1) ... [2022-07-19 14:12:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:12:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:12:17,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:12:17,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:12:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:12:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-19 14:12:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-19 14:12:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:12:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:12:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:12:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:12:17,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:12:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:12:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:12:17,981 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:12:17,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:12:19,059 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:12:19,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:12:19,064 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 14:12:19,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19 BoogieIcfgContainer [2022-07-19 14:12:19,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:12:19,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:12:19,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:12:19,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:12:19,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:12:17" (1/3) ... [2022-07-19 14:12:19,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2c8290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:19, skipping insertion in model container [2022-07-19 14:12:19,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:12:17" (2/3) ... [2022-07-19 14:12:19,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2c8290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:12:19, skipping insertion in model container [2022-07-19 14:12:19,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19" (3/3) ... [2022-07-19 14:12:19,070 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2022-07-19 14:12:19,080 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:12:19,081 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:12:19,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:12:19,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49cfb567, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25a9c50c [2022-07-19 14:12:19,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:12:19,122 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) [2022-07-19 14:12:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:12:19,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:19,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:19,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:19,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-19 14:12:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501176635] [2022-07-19 14:12:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:19,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:19,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:12:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:19,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:12:19,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:19,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:19,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:19,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501176635] [2022-07-19 14:12:19,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501176635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:19,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:19,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:12:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67556116] [2022-07-19 14:12:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:19,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:12:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:12:19,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:19,254 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) [2022-07-19 14:12:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:19,266 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-19 14:12:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:12:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:12:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:19,273 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:12:19,274 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 14:12:19,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:12:19,278 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:19,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:12:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 14:12:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-19 14:12:19,298 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) [2022-07-19 14:12:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-19 14:12:19,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-19 14:12:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:19,300 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-19 14:12:19,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-19 14:12:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:19,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:19,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:19,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:19,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:19,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-19 14:12:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:19,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368392203] [2022-07-19 14:12:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:19,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:19,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:19,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:12:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:19,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:12:19,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:19,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:19,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:19,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368392203] [2022-07-19 14:12:19,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368392203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:19,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:19,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:12:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214842105] [2022-07-19 14:12:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:19,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:12:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:12:19,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:12:19,739 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) [2022-07-19 14:12:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:20,397 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-19 14:12:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:20,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 14:12:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:20,398 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:12:20,398 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:12:20,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:12:20,400 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:20,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 22 Unchecked, 0.6s Time] [2022-07-19 14:12:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:12:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-19 14:12:20,402 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) [2022-07-19 14:12:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-19 14:12:20,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2022-07-19 14:12:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:20,403 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-19 14:12:20,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-19 14:12:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:12:20,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:20,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:20,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:20,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:20,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1803079892, now seen corresponding path program 1 times [2022-07-19 14:12:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:20,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300651776] [2022-07-19 14:12:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:20,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:20,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:20,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:20,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:12:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:20,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:12:20,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:20,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:20,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:20,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300651776] [2022-07-19 14:12:20,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300651776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:20,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:20,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:12:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527593464] [2022-07-19 14:12:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:20,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:12:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:12:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:12:20,755 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) [2022-07-19 14:12:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:21,046 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-19 14:12:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:21,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 14:12:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:21,048 INFO L225 Difference]: With dead ends: 43 [2022-07-19 14:12:21,048 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:21,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:12:21,049 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:21,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2022-07-19 14:12:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:21,051 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) [2022-07-19 14:12:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-19 14:12:21,051 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-07-19 14:12:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:21,052 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-19 14:12:21,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-19 14:12:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:12:21,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:21,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:21,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:21,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2022-07-19 14:12:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:21,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181964650] [2022-07-19 14:12:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:21,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:21,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:21,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:12:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:21,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:12:21,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:21,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:21,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181964650] [2022-07-19 14:12:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181964650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:21,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:21,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:12:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492544262] [2022-07-19 14:12:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:21,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:12:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:12:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:12:21,486 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) [2022-07-19 14:12:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:21,558 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-19 14:12:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:12:21,559 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 [2022-07-19 14:12:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:21,560 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:12:21,560 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:21,560 INFO L412 NwaCegarLoop]: 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 [2022-07-19 14:12:21,561 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2022-07-19 14:12:21,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:12:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:21,563 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) [2022-07-19 14:12:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-19 14:12:21,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-07-19 14:12:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:21,563 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-19 14:12:21,563 INFO L496 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) [2022-07-19 14:12:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-19 14:12:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:12:21,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:21,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:21,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 14:12:21,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:21,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2022-07-19 14:12:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201642621] [2022-07-19 14:12:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:21,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:21,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:12:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:21,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 14:12:21,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:21,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:21,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201642621] [2022-07-19 14:12:21,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201642621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:21,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:21,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:12:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558421133] [2022-07-19 14:12:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:21,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:12:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:12:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:12:21,946 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) [2022-07-19 14:12:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:21,964 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-07-19 14:12:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:21,964 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 [2022-07-19 14:12:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:21,964 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:12:21,964 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:21,965 INFO L412 NwaCegarLoop]: 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 [2022-07-19 14:12:21,965 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:21,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-19 14:12:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:21,967 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) [2022-07-19 14:12:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-19 14:12:21,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-07-19 14:12:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:21,968 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-19 14:12:21,968 INFO L496 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) [2022-07-19 14:12:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-19 14:12:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:12:21,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:21,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:21,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:22,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash 461150674, now seen corresponding path program 1 times [2022-07-19 14:12:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:22,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148594274] [2022-07-19 14:12:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:22,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:22,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:12:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:22,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:12:22,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:22,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:22,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:22,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148594274] [2022-07-19 14:12:22,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148594274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:22,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:22,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:12:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533070717] [2022-07-19 14:12:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:22,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:12:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:12:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:12:22,367 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) [2022-07-19 14:12:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:22,390 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-19 14:12:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:12:22,394 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 [2022-07-19 14:12:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:22,395 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:12:22,395 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:22,395 INFO L412 NwaCegarLoop]: 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 [2022-07-19 14:12:22,396 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:22,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-07-19 14:12:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:22,398 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) [2022-07-19 14:12:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-07-19 14:12:22,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-07-19 14:12:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:22,399 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-07-19 14:12:22,399 INFO L496 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) [2022-07-19 14:12:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-07-19 14:12:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:12:22,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:22,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:22,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:22,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,612 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -348195952, now seen corresponding path program 1 times [2022-07-19 14:12:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835563690] [2022-07-19 14:12:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:22,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:22,614 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:12:22,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:12:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:22,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 14:12:22,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:22,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-19 14:12:22,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-19 14:12:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:22,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:22,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:22,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835563690] [2022-07-19 14:12:22,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835563690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:22,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:22,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:12:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490456012] [2022-07-19 14:12:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:22,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:12:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:22,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:12:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:12:22,923 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) [2022-07-19 14:12:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:22,984 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-19 14:12:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:12:22,985 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 [2022-07-19 14:12:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:22,985 INFO L225 Difference]: With dead ends: 25 [2022-07-19 14:12:22,985 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:12:22,985 INFO L412 NwaCegarLoop]: 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 [2022-07-19 14:12:22,986 INFO L413 NwaCegarLoop]: 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 [2022-07-19 14:12:22,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-19 14:12:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:12:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:12:22,988 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) [2022-07-19 14:12:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-07-19 14:12:22,988 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2022-07-19 14:12:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:22,988 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-07-19 14:12:22,988 INFO L496 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) [2022-07-19 14:12:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-07-19 14:12:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:12:22,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:12:22,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:23,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:23,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:23,199 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:12:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:12:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -475618843, now seen corresponding path program 1 times [2022-07-19 14:12:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:12:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311825663] [2022-07-19 14:12:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:12:23,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:12:23,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:12:23,201 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) [2022-07-19 14:12:23,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:12:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:12:23,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 14:12:23,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:12:23,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-19 14:12:23,453 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:12:23,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-19 14:12:23,642 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:12:23,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 29 [2022-07-19 14:12:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:12:23,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:12:23,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:12:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311825663] [2022-07-19 14:12:23,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311825663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:12:23,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:12:23,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 14:12:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136329740] [2022-07-19 14:12:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:12:23,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:12:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:12:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:12:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:12:23,763 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) [2022-07-19 14:12:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:12:23,814 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-07-19 14:12:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:12:23,815 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 [2022-07-19 14:12:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:12:23,815 INFO L225 Difference]: With dead ends: 22 [2022-07-19 14:12:23,815 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:12:23,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:12:23,816 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:12:23,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-19 14:12:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:12:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:12:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:12:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:12:23,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-07-19 14:12:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:12:23,817 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:12:23,817 INFO L496 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) [2022-07-19 14:12:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:12:23,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:12:23,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:12:23,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:12:24,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:12:24,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:12:24,101 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2022-07-19 14:12:24,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:12:24,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:12:24,102 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2022-07-19 14:12:24,102 INFO L895 garLoopResultBuilder]: At program point L78(lines 18 79) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= 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 ((.cse1 (select .cse3 (_ bv4 32)))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse1) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_floor_double_#res#1|) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|)) (= (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))))))))) [2022-07-19 14:12:24,102 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2022-07-19 14:12:24,102 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-19 14:12:24,102 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= |ULTIMATE.start_floor_double_~x#1| (fp.neg (_ +zero 11 53))) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-19 14:12:24,102 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L104-2(lines 104 107) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-19 14:12:24,103 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L895 garLoopResultBuilder]: At program point L90(lines 81 91) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2022-07-19 14:12:24,104 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 88) no Hoare annotation was computed. [2022-07-19 14:12:24,105 INFO L895 garLoopResultBuilder]: At program point L84-2(lines 84 88) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (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 ((.cse1 (select .cse3 (_ bv4 32)))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse1) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start___signbit_double_~x#1|) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|)) (= (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))))))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-19 14:12:24,106 INFO L899 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2022-07-19 14:12:24,106 INFO L902 garLoopResultBuilder]: At program point L109(lines 93 110) the Hoare annotation is: true [2022-07-19 14:12:24,106 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-07-19 14:12:24,106 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-07-19 14:12:24,108 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:12:24,110 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:12:24,116 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] [2022-07-19 14:12:24,117 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] [2022-07-19 14:12:24,117 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 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] [2022-07-19 14:12:24,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,124 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] [2022-07-19 14:12:24,125 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] [2022-07-19 14:12:24,125 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] [2022-07-19 14:12:24,125 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] [2022-07-19 14:12:24,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,128 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] [2022-07-19 14:12:24,128 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] [2022-07-19 14:12:24,128 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 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] [2022-07-19 14:12:24,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,131 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] [2022-07-19 14:12:24,132 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] [2022-07-19 14:12:24,132 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] [2022-07-19 14:12:24,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:12:24 BoogieIcfgContainer [2022-07-19 14:12:24,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:12:24,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:12:24,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:12:24,134 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:12:24,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:12:19" (3/4) ... [2022-07-19 14:12:24,137 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:12:24,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-19 14:12:24,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-19 14:12:24,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:12:24,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:12:24,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 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 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~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]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~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())) [2022-07-19 14:12:24,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\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 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~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]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~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-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-19 14:12:24,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 1bv32 == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-19 14:12:24,184 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:12:24,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:12:24,185 INFO L158 Benchmark]: Toolchain (without parser) took 6653.29ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 43.3MB in the beginning and 34.8MB in the end (delta: 8.5MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,185 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:12:24,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.25ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 44.9MB in the end (delta: -1.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,186 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 41.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,186 INFO L158 Benchmark]: RCFGBuilder took 1238.50ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 41.2MB in the beginning and 63.3MB in the end (delta: -22.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,186 INFO L158 Benchmark]: TraceAbstraction took 5067.33ms. Allocated memory is still 81.8MB. Free memory was 63.0MB in the beginning and 38.3MB in the end (delta: 24.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,187 INFO L158 Benchmark]: Witness Printer took 50.19ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 34.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:12:24,189 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.10ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.25ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 44.9MB in the end (delta: -1.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 41.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1238.50ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 41.2MB in the beginning and 63.3MB in the end (delta: -22.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5067.33ms. Allocated memory is still 81.8MB. Free memory was 63.0MB in the beginning and 38.3MB in the end (delta: 24.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Witness Printer took 50.19ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 34.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_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_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_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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_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_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_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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_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_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_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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_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_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_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 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.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 95 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 193 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 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, 210 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.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 43 QuantifiedInterpolants, 1415 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 [2022-07-19 14:12:24,201 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] [2022-07-19 14:12:24,201 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] [2022-07-19 14:12:24,201 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] [2022-07-19 14:12:24,201 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] [2022-07-19 14:12:24,202 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] [2022-07-19 14:12:24,202 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] [2022-07-19 14:12:24,202 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] [2022-07-19 14:12:24,202 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] [2022-07-19 14:12:24,202 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] [2022-07-19 14:12:24,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,204 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] [2022-07-19 14:12:24,205 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] [2022-07-19 14:12:24,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,205 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\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 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~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]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~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-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 81]: Loop Invariant [2022-07-19 14:12:24,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 1bv32 == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-07-19 14:12:24,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,206 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 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] [2022-07-19 14:12:24,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,208 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] [2022-07-19 14:12:24,209 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] [2022-07-19 14:12:24,209 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] [2022-07-19 14:12:24,209 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] [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] Derived loop invariant: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 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 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~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]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~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())) - InvariantResult [Line: 21]: Loop Invariant [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-19 14:12:24,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-19 14:12:24,239 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