./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1092d.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092d.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 3af1cc7b717b9387beaa6f5748bd79e907549cdc0103a27a33252f549ff317c1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:36,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:36,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:36,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:36,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:36,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:36,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:36,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:36,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:36,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:36,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:36,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:36,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:36,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:36,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:36,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:36,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:36,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:36,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:36,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:36,538 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:36,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:36,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:36,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:36,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:36,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:36,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:36,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:36,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:36,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:36,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:36,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:36,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:36,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:36,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:36,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:36,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:36,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:36,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:36,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:36,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:36,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:36,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:03:36,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:36,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:36,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:36,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:36,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:36,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:36,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:36,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:36,586 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:36,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:36,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:36,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:03:36,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:36,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:36,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:36,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:36,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:36,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:36,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:36,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:36,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:36,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:36,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:36,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:36,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:36,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:36,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:36,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:36,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:03:36,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:03:36,592 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:36,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:36,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:36,592 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 -> 3af1cc7b717b9387beaa6f5748bd79e907549cdc0103a27a33252f549ff317c1 [2022-07-12 03:03:36,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:36,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:36,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:36,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:36,875 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:36,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092d.c [2022-07-12 03:03:36,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbb6adfe/b451a2e09d5641238ce82c619d070716/FLAG6293ad7d3 [2022-07-12 03:03:37,383 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:37,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092d.c [2022-07-12 03:03:37,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbb6adfe/b451a2e09d5641238ce82c619d070716/FLAG6293ad7d3 [2022-07-12 03:03:37,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bbb6adfe/b451a2e09d5641238ce82c619d070716 [2022-07-12 03:03:37,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:37,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:37,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:37,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:37,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:37,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793d0e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37, skipping insertion in model container [2022-07-12 03:03:37,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:37,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:37,647 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_1092d.c[2417,2430] [2022-07-12 03:03:37,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:37,660 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:37,703 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_1092d.c[2417,2430] [2022-07-12 03:03:37,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:37,717 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:37,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37 WrapperNode [2022-07-12 03:03:37,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:37,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:37,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:37,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:37,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,774 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-12 03:03:37,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:37,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:37,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:37,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:37,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:37,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:37,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:37,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:37,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (1/1) ... [2022-07-12 03:03:37,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:37,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:37,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:03:37,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:03:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:03:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:03:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:37,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:03:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:37,982 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:37,984 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:38,332 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:38,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:38,342 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:38,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:38 BoogieIcfgContainer [2022-07-12 03:03:38,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:38,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:38,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:38,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:38,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:37" (1/3) ... [2022-07-12 03:03:38,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250f3908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:38, skipping insertion in model container [2022-07-12 03:03:38,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:37" (2/3) ... [2022-07-12 03:03:38,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250f3908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:38, skipping insertion in model container [2022-07-12 03:03:38,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:38" (3/3) ... [2022-07-12 03:03:38,358 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092d.c [2022-07-12 03:03:38,372 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:38,372 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:38,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:38,438 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@7efebc78, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7096914 [2022-07-12 03:03:38,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:03:38,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:38,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:38,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-12 03:03:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:38,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390680677] [2022-07-12 03:03:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390680677] [2022-07-12 03:03:38,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390680677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:38,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:38,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288692118] [2022-07-12 03:03:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:38,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:38,638 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:38,661 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-12 03:03:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:03:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:38,670 INFO L225 Difference]: With dead ends: 72 [2022-07-12 03:03:38,671 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:03:38,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:38,677 INFO L413 NwaCegarLoop]: 51 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, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:38,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:03:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 03:03:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-12 03:03:38,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-12 03:03:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:38,714 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-12 03:03:38,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-12 03:03:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:38,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:38,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:03:38,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-12 03:03:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:38,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666988053] [2022-07-12 03:03:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:39,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:03:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:39,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:03:39,397 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:03:39,399 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:03:39,404 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 03:03:39,407 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:39,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:39 BoogieIcfgContainer [2022-07-12 03:03:39,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:39,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:39,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:39,449 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:39,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:38" (3/4) ... [2022-07-12 03:03:39,452 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:03:39,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:39,453 INFO L158 Benchmark]: Toolchain (without parser) took 2036.02ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 95.8MB in the beginning and 90.8MB in the end (delta: 5.0MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,453 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 121.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:39,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.46ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 95.8MB in the beginning and 142.4MB in the end (delta: -46.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.78ms. Allocated memory is still 169.9MB. Free memory was 141.9MB in the beginning and 138.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,458 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,459 INFO L158 Benchmark]: RCFGBuilder took 523.19ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 112.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,459 INFO L158 Benchmark]: TraceAbstraction took 1101.65ms. Allocated memory is still 169.9MB. Free memory was 112.1MB in the beginning and 91.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-07-12 03:03:39,459 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 169.9MB. Free memory was 91.1MB in the beginning and 90.8MB in the end (delta: 282.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:39,464 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.25ms. Allocated memory is still 121.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.46ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 95.8MB in the beginning and 142.4MB in the end (delta: -46.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.78ms. Allocated memory is still 169.9MB. Free memory was 141.9MB in the beginning and 138.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.19ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 112.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1101.65ms. Allocated memory is still 169.9MB. Free memory was 112.1MB in the beginning and 91.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 169.9MB. Free memory was 91.1MB in the beginning and 90.8MB in the end (delta: 282.2kB). 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: 110]: 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 40, overapproximation of bitwiseOr at line 92, overapproximation of someBinaryArithmeticDOUBLEoperation at line 105, overapproximation of bitwiseAnd at line 91. Possible FailurePath: [L16] static const double huge_ceil = 1.0e300; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L105] double x = -1.0 / 0.0; [L106] CALL, EXPR ceil_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L29] COND FALSE !(j0 < 0) [L40] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L41] COND TRUE ((i0 & i) | i1) == 0 [L42] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=8388606, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L106] RET, EXPR ceil_double(x) [L106] double res = ceil_double(x); [L109] CALL, EXPR isinf_double(res) [L84] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L86] ieee_double_shape_type ew_u; [L87] ew_u.value = (x) [L88] EXPR ew_u.parts.msw [L88] (hx) = ew_u.parts.msw [L89] EXPR ew_u.parts.lsw [L89] (lx) = ew_u.parts.lsw [L91] hx &= 0x7fffffff [L92] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L93] hx = 0x7ff00000 - hx [L94] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1, lx=-2, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L109] RET, EXPR isinf_double(res) [L109] COND TRUE !isinf_double(res) [L110] reach_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, 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, 51 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, 51 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 03:03:39,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092d.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 3af1cc7b717b9387beaa6f5748bd79e907549cdc0103a27a33252f549ff317c1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:41,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:41,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:41,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:41,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:41,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:41,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:41,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:41,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:41,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:41,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:41,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:41,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:41,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:41,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:41,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:41,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:41,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:41,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:41,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:41,535 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:41,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:41,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:41,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:41,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:41,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:41,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:41,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:41,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:41,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:41,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:41,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:41,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:41,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:41,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:41,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:41,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:41,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:41,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:41,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:41,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:41,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:41,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:03:41,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:41,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:41,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:41,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:41,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:41,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:41,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:41,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:41,597 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:41,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:41,598 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:41,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:41,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:41,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:03:41,599 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:41,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:41,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:41,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:41,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:41,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:41,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:41,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:41,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:41,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:41,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:41,602 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:03:41,602 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:03:41,602 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:41,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:41,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:41,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:03:41,607 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 -> 3af1cc7b717b9387beaa6f5748bd79e907549cdc0103a27a33252f549ff317c1 [2022-07-12 03:03:41,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:41,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:41,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:41,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:41,931 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:41,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092d.c [2022-07-12 03:03:41,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd602320b/031cf5f3113c4472a9773a0e9adb6e40/FLAGf7e5ade96 [2022-07-12 03:03:42,415 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:42,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092d.c [2022-07-12 03:03:42,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd602320b/031cf5f3113c4472a9773a0e9adb6e40/FLAGf7e5ade96 [2022-07-12 03:03:42,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd602320b/031cf5f3113c4472a9773a0e9adb6e40 [2022-07-12 03:03:42,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:42,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:42,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:42,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:42,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:42,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b043cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42, skipping insertion in model container [2022-07-12 03:03:42,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:42,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:42,675 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_1092d.c[2417,2430] [2022-07-12 03:03:42,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:42,692 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:42,735 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_1092d.c[2417,2430] [2022-07-12 03:03:42,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:42,753 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:42,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42 WrapperNode [2022-07-12 03:03:42,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:42,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:42,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:42,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:42,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,800 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-12 03:03:42,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:42,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:42,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:42,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:42,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:42,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:42,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:42,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:42,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (1/1) ... [2022-07-12 03:03:42,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:42,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:42,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:03:42,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:03:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 03:03:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:03:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:03:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:03:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:03:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:43,005 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:43,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:44,047 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:44,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:44,052 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:44,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:44 BoogieIcfgContainer [2022-07-12 03:03:44,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:44,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:44,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:44,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:44,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:42" (1/3) ... [2022-07-12 03:03:44,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343994ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:44, skipping insertion in model container [2022-07-12 03:03:44,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:42" (2/3) ... [2022-07-12 03:03:44,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343994ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:44, skipping insertion in model container [2022-07-12 03:03:44,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:44" (3/3) ... [2022-07-12 03:03:44,061 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092d.c [2022-07-12 03:03:44,075 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:44,075 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:44,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:44,129 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@1b21ffba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23b30b0f [2022-07-12 03:03:44,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:03:44,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:44,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:44,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-12 03:03:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:44,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058593956] [2022-07-12 03:03:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:44,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:44,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:03:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:44,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:03:44,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:44,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:44,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058593956] [2022-07-12 03:03:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058593956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:44,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:44,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432020802] [2022-07-12 03:03:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:44,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:44,351 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:44,375 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-12 03:03:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:03:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:44,384 INFO L225 Difference]: With dead ends: 72 [2022-07-12 03:03:44,384 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:03:44,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:44,389 INFO L413 NwaCegarLoop]: 51 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, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:44,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:03:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 03:03:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-12 03:03:44,423 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-12 03:03:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:44,423 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-12 03:03:44,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-12 03:03:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:44,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:44,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:44,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 03:03:44,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:44,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-12 03:03:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:44,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550213323] [2022-07-12 03:03:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:44,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:44,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:03:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:44,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:44,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:44,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:44,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550213323] [2022-07-12 03:03:44,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550213323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:44,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:45,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602486736] [2022-07-12 03:03:45,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:45,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:45,006 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:45,014 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-12 03:03:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:45,015 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:03:45,015 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:03:45,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:45,017 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:45,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-12 03:03:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:03:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:03:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-12 03:03:45,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-07-12 03:03:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:45,028 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-12 03:03:45,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-12 03:03:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:45,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:45,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:45,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:45,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1129837443, now seen corresponding path program 1 times [2022-07-12 03:03:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:45,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981868775] [2022-07-12 03:03:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:45,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:45,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:45,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:45,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:03:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:45,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:45,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:45,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:45,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:45,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981868775] [2022-07-12 03:03:45,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981868775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:45,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:45,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:45,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089952377] [2022-07-12 03:03:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:45,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:45,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:45,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:45,506 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:45,509 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-12 03:03:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:45,509 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:03:45,509 INFO L226 Difference]: Without dead ends: 16 [2022-07-12 03:03:45,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:45,510 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:45,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-07-12 03:03:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-12 03:03:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-12 03:03:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-12 03:03:45,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2022-07-12 03:03:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:45,513 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-12 03:03:45,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-12 03:03:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-12 03:03:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:45,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:45,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:45,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:45,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:45,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1582346339, now seen corresponding path program 1 times [2022-07-12 03:03:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:45,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490034619] [2022-07-12 03:03:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:45,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:45,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:45,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:03:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:45,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 03:03:45,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:46,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:46,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:46,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490034619] [2022-07-12 03:03:46,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490034619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:46,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:46,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:03:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355364686] [2022-07-12 03:03:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:46,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:03:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:03:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:03:46,212 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-12 03:03:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:46,360 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-12 03:03:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:03:46,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-12 03:03:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:46,360 INFO L225 Difference]: With dead ends: 16 [2022-07-12 03:03:46,360 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:03:46,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:03:46,361 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:46,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-12 03:03:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:03:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:03:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:03:46,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-07-12 03:03:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:46,362 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:03:46,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-12 03:03:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:03:46,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:03:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:46,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 03:03:46,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:46,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:03:46,661 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 69) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 60 69) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L895 garLoopResultBuilder]: At program point L85-2(lines 85 90) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= .cse0 |ULTIMATE.start_ceil_double_#res#1|) (= .cse0 |ULTIMATE.start_isinf_double_~x#1|) (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L85-3(lines 85 90) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-07-12 03:03:46,662 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L895 garLoopResultBuilder]: At program point L94(lines 83 95) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_13|)) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= (bvadd (_ bv1 32) (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvlshr (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_13|))) (bvor (bvneg .cse2) .cse2)) (_ bv31 32)) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_13|))))))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32)))) |ULTIMATE.start_isinf_double_#res#1|))) [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 68) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 72) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 49) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-12 03:03:46,663 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:03:46,663 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L895 garLoopResultBuilder]: At program point L79(lines 18 80) the Hoare annotation is: (and (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_ceil_double_#res#1|) (= |ULTIMATE.start_ceil_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 38) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 37) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L902 garLoopResultBuilder]: At program point L114(lines 97 115) the Hoare annotation is: true [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 78) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 18 80) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 78) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 66) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 66) no Hoare annotation was computed. [2022-07-12 03:03:46,664 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 42) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 72) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 37) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 71) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 54) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 112) no Hoare annotation was computed. [2022-07-12 03:03:46,665 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-07-12 03:03:46,668 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-12 03:03:46,670 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:46,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:46 BoogieIcfgContainer [2022-07-12 03:03:46,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:46,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:46,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:46,726 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:46,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:44" (3/4) ... [2022-07-12 03:03:46,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:03:46,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-12 03:03:46,747 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 03:03:46,747 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:03:46,747 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:03:46,763 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:03:46,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:03:46,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) [2022-07-12 03:03:46,778 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:03:46,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:46,778 INFO L158 Benchmark]: Toolchain (without parser) took 4336.85ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 29.9MB in the beginning and 53.4MB in the end (delta: -23.6MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,779 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:46,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.95ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.7MB in the beginning and 44.7MB in the end (delta: -15.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.42ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 42.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,779 INFO L158 Benchmark]: Boogie Preprocessor took 52.39ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 41.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,780 INFO L158 Benchmark]: RCFGBuilder took 1199.31ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 42.1MB in the end (delta: -960.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,780 INFO L158 Benchmark]: TraceAbstraction took 2669.32ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 41.7MB in the beginning and 57.1MB in the end (delta: -15.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,780 INFO L158 Benchmark]: Witness Printer took 52.79ms. Allocated memory is still 79.7MB. Free memory was 57.1MB in the beginning and 53.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:03:46,781 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.44ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.95ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.7MB in the beginning and 44.7MB in the end (delta: -15.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.42ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 42.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.39ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 41.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1199.31ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 42.1MB in the end (delta: -960.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2669.32ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 41.7MB in the beginning and 57.1MB in the end (delta: -15.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 52.79ms. Allocated memory is still 79.7MB. Free memory was 57.1MB in the beginning and 53.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,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 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 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 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 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 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 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 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 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 * 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: 110]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 98 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 161 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 13 QuantifiedInterpolants, 536 SizeOfPredicates, 26 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 83]: Loop Invariant [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-12 03:03:46,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant [2022-07-12 03:03:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:46,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-12 03:03:46,831 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 Writing output log to file Ultimate.log Result: TRUE