./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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-benchs/sqrt_Householder_constant.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 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:20:39,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:20:39,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:20:39,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:20:39,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:20:39,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:20:39,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:20:39,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:20:39,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:20:39,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:20:39,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:20:39,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:20:39,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:20:39,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:20:39,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:20:39,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:20:39,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:20:39,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:20:39,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:20:39,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:20:39,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:20:39,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:20:39,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:20:39,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:20:39,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:20:39,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:20:39,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:20:39,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:20:39,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:20:39,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:20:39,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:20:39,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:20:39,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:20:39,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:20:39,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:20:39,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:20:39,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:20:39,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:20:39,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:20:39,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:20:39,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:20:39,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:20:39,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:20:40,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:20:40,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:20:40,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:20:40,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:20:40,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:20:40,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:20:40,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:20:40,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:20:40,018 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:20:40,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:20:40,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:20:40,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:20:40,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:20:40,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:20:40,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:20:40,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:20:40,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:20:40,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:20:40,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:20:40,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:20:40,022 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:20:40,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:20:40,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:20:40,022 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 -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2022-07-13 14:20:40,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:20:40,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:20:40,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:20:40,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:20:40,208 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:20:40,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-13 14:20:40,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3432d47f9/4834483a4157411e8c0fade8c56a79f2/FLAG325f82f4b [2022-07-13 14:20:40,596 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:20:40,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-13 14:20:40,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3432d47f9/4834483a4157411e8c0fade8c56a79f2/FLAG325f82f4b [2022-07-13 14:20:40,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3432d47f9/4834483a4157411e8c0fade8c56a79f2 [2022-07-13 14:20:40,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:20:40,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:20:40,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:20:40,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:20:40,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:20:40,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dec5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40, skipping insertion in model container [2022-07-13 14:20:40,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:20:40,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:20:40,781 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-benchs/sqrt_Householder_constant.c[831,844] [2022-07-13 14:20:40,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:20:40,797 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:20:40,804 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-benchs/sqrt_Householder_constant.c[831,844] [2022-07-13 14:20:40,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:20:40,816 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:20:40,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40 WrapperNode [2022-07-13 14:20:40,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:20:40,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:20:40,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:20:40,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:20:40,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,837 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-07-13 14:20:40,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:20:40,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:20:40,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:20:40,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:20:40,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:20:40,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:20:40,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:20:40,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:20:40,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (1/1) ... [2022-07-13 14:20:40,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:20:40,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:20:40,895 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-13 14:20:40,907 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-13 14:20:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:20:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:20:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:20:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:20:40,977 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:20:40,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:20:41,060 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:20:41,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:20:41,077 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 14:20:41,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:20:41 BoogieIcfgContainer [2022-07-13 14:20:41,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:20:41,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:20:41,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:20:41,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:20:41,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:20:40" (1/3) ... [2022-07-13 14:20:41,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599c8121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:20:41, skipping insertion in model container [2022-07-13 14:20:41,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:40" (2/3) ... [2022-07-13 14:20:41,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599c8121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:20:41, skipping insertion in model container [2022-07-13 14:20:41,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:20:41" (3/3) ... [2022-07-13 14:20:41,090 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2022-07-13 14:20:41,111 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:20:41,111 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:20:41,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:20:41,160 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@11b322d7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e2afeec [2022-07-13 14:20:41,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:20:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:20:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:20:41,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:20:41,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:20:41,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:20:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:20:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2022-07-13 14:20:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:20:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512237293] [2022-07-13 14:20:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:20:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:20:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:20:41,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:20:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:20:41,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:20:41,284 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:20:41,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:20:41,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:20:41,289 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-13 14:20:41,292 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:20:41,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:20:41 BoogieIcfgContainer [2022-07-13 14:20:41,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:20:41,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:20:41,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:20:41,308 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:20:41,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:20:41" (3/4) ... [2022-07-13 14:20:41,310 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:20:41,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:20:41,311 INFO L158 Benchmark]: Toolchain (without parser) took 699.49ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 55.2MB in the end (delta: 21.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,311 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:20:41,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.19ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 82.4MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.69ms. Allocated memory is still 107.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,325 INFO L158 Benchmark]: Boogie Preprocessor took 19.25ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,326 INFO L158 Benchmark]: RCFGBuilder took 223.09ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 70.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,327 INFO L158 Benchmark]: TraceAbstraction took 223.97ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 55.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 14:20:41,327 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 107.0MB. Free memory was 55.4MB in the beginning and 55.2MB in the end (delta: 256.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:20:41,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.19ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 82.4MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.69ms. Allocated memory is still 107.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.25ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.09ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 70.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 223.97ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 55.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 107.0MB. Free memory was 55.4MB in the beginning and 55.2MB in the end (delta: 256.0kB). 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: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000, d=1] [L51] COND TRUE d <= 20. [L53] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L35] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L44] return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L53] RET, EXPR SqrtR(d) [L53] r = SqrtR(d) [L55] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) [L20] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L20] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-13 14:20:41,367 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-benchs/sqrt_Householder_constant.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 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:20:43,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:20:43,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:20:43,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:20:43,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:20:43,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:20:43,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:20:43,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:20:43,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:20:43,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:20:43,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:20:43,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:20:43,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:20:43,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:20:43,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:20:43,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:20:43,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:20:43,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:20:43,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:20:43,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:20:43,069 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:20:43,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:20:43,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:20:43,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:20:43,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:20:43,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:20:43,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:20:43,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:20:43,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:20:43,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:20:43,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:20:43,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:20:43,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:20:43,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:20:43,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:20:43,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:20:43,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:20:43,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:20:43,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:20:43,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:20:43,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:20:43,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:20:43,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:20:43,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:20:43,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:20:43,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:20:43,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:20:43,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:20:43,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:20:43,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:20:43,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:20:43,116 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:20:43,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:20:43,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:20:43,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:20:43,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:20:43,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:20:43,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:20:43,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:20:43,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:20:43,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:20:43,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:20:43,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:20:43,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:20:43,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:20:43,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:20:43,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:20:43,127 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:20:43,127 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:20:43,127 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:20:43,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:20:43,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:20:43,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:20:43,128 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 -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2022-07-13 14:20:43,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:20:43,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:20:43,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:20:43,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:20:43,396 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:20:43,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-13 14:20:43,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59eafa61/ebd5c221396540cb939a5b95eabde251/FLAGa5254f7b2 [2022-07-13 14:20:43,802 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:20:43,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-13 14:20:43,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59eafa61/ebd5c221396540cb939a5b95eabde251/FLAGa5254f7b2 [2022-07-13 14:20:43,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59eafa61/ebd5c221396540cb939a5b95eabde251 [2022-07-13 14:20:43,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:20:43,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:20:43,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:20:43,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:20:43,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:20:43,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:20:43" (1/1) ... [2022-07-13 14:20:43,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f1e283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:43, skipping insertion in model container [2022-07-13 14:20:43,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:20:43" (1/1) ... [2022-07-13 14:20:43,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:20:43,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:20:43,951 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-benchs/sqrt_Householder_constant.c[831,844] [2022-07-13 14:20:43,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:20:43,997 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:20:44,017 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-benchs/sqrt_Householder_constant.c[831,844] [2022-07-13 14:20:44,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:20:44,044 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:20:44,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44 WrapperNode [2022-07-13 14:20:44,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:20:44,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:20:44,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:20:44,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:20:44,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,067 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-07-13 14:20:44,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:20:44,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:20:44,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:20:44,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:20:44,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:20:44,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:20:44,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:20:44,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:20:44,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (1/1) ... [2022-07-13 14:20:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:20:44,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:20:44,121 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-13 14:20:44,123 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-13 14:20:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:20:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:20:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:20:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:20:44,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:20:44,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:20:51,634 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:20:51,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:20:51,638 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 14:20:51,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:20:51 BoogieIcfgContainer [2022-07-13 14:20:51,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:20:51,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:20:51,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:20:51,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:20:51,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:20:43" (1/3) ... [2022-07-13 14:20:51,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49424879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:20:51, skipping insertion in model container [2022-07-13 14:20:51,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:20:44" (2/3) ... [2022-07-13 14:20:51,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49424879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:20:51, skipping insertion in model container [2022-07-13 14:20:51,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:20:51" (3/3) ... [2022-07-13 14:20:51,645 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2022-07-13 14:20:51,664 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:20:51,664 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:20:51,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:20:51,699 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@4afbdd6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ff6ca62 [2022-07-13 14:20:51,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:20:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:20:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:20:51,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:20:51,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:20:51,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:20:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:20:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2022-07-13 14:20:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:20:51,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751489210] [2022-07-13 14:20:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:20:51,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:20:51,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:20:51,721 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-13 14:20:51,733 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-13 14:20:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:20:52,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 14:20:52,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:20:53,697 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-13 14:20:53,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:20:53,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:20:53,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751489210] [2022-07-13 14:20:53,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751489210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:20:53,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:20:53,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:20:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079424164] [2022-07-13 14:20:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:20:53,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:20:53,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:20:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:20:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:20:53,732 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-13 14:20:56,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:20:58,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:01,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:04,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:21:05,097 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-07-13 14:21:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:21:05,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-13 14:21:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:21:05,112 INFO L225 Difference]: With dead ends: 40 [2022-07-13 14:21:05,112 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 14:21:05,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:21:05,116 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:21:05,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2022-07-13 14:21:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 14:21:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 14:21:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:21:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 14:21:05,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2022-07-13 14:21:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:21:05,137 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 14:21:05,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-13 14:21:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-13 14:21:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:21:05,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:21:05,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:21:05,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 14:21:05,349 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-13 14:21:05,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:21:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:21:05,350 INFO L85 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2022-07-13 14:21:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:21:05,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295282077] [2022-07-13 14:21:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:21:05,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:21:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:21:05,352 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-13 14:21:05,354 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-13 14:21:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:21:06,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 14:21:06,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:21:07,209 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-13 14:21:07,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:21:07,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:21:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295282077] [2022-07-13 14:21:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295282077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:21:07,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:21:07,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:21:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902198060] [2022-07-13 14:21:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:21:07,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:21:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:21:07,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:21:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:21:07,211 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-13 14:21:08,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:11,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:14,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:16,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:19,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:21,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:24,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:26,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:21:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:21:26,318 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-07-13 14:21:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:21:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-13 14:21:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:21:26,419 INFO L225 Difference]: With dead ends: 28 [2022-07-13 14:21:26,419 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 14:21:26,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:21:26,420 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-07-13 14:21:26,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 7 Unknown, 0 Unchecked, 18.9s Time] [2022-07-13 14:21:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 14:21:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 14:21:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-13 14:21:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-13 14:21:26,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2022-07-13 14:21:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:21:26,423 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 14:21:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-13 14:21:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-13 14:21:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 14:21:26,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:21:26,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:21:26,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 14:21:26,629 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-13 14:21:26,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:21:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:21:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2022-07-13 14:21:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:21:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610747088] [2022-07-13 14:21:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:21:26,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:21:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:21:26,632 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-13 14:21:26,633 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-13 14:21:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:21:29,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:21:29,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:21:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:21:33,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:21:45,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-13 14:22:02,566 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:08,877 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:11,500 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-13 14:22:14,113 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-13 14:22:19,976 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:25,995 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:31,302 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:36,585 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:38,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2022-07-13 14:22:41,378 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2022-07-13 14:22:46,775 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:52,078 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:22:54,488 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2022-07-13 14:22:56,890 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2022-07-13 14:22:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 14:22:56,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:22:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610747088] [2022-07-13 14:22:56,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610747088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:22:56,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:22:56,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-13 14:22:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884411359] [2022-07-13 14:22:56,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:22:56,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 14:22:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:22:56,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 14:22:56,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=84, Unknown=7, NotChecked=84, Total=210 [2022-07-13 14:22:56,926 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:22:59,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:01,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:04,437 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-13 14:23:06,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-07-13 14:23:09,253 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-13 14:23:11,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-07-13 14:23:14,376 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-13 14:23:31,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:33,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:52,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:54,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:56,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:23:57,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:24:01,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:24:03,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:24:06,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:24:09,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:24:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:24:09,502 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-13 14:24:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 14:24:09,505 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 14:24:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:24:09,509 INFO L225 Difference]: With dead ends: 29 [2022-07-13 14:24:09,509 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 14:24:09,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=62, Invalid=132, Unknown=16, NotChecked=210, Total=420 [2022-07-13 14:24:09,511 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:24:09,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 10 Unknown, 74 Unchecked, 30.3s Time] [2022-07-13 14:24:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 14:24:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-07-13 14:24:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:24:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-13 14:24:09,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2022-07-13 14:24:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:24:09,520 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-13 14:24:09,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:24:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-13 14:24:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:24:09,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:24:09,521 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:24:09,621 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-13 14:24:09,721 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-13 14:24:09,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:24:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:24:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2022-07-13 14:24:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:24:09,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533578333] [2022-07-13 14:24:09,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 14:24:09,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:24:09,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:24:09,732 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-13 14:24:09,733 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-13 14:24:15,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 14:24:15,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 14:24:15,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 14:24:15,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:24:27,545 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:24:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:24:31,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:24:41,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-13 14:24:43,744 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-13 14:24:57,485 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:25:03,493 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:25:06,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-13 14:25:08,790 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-13 14:25:10,386 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-13 14:25:10,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:25:10,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533578333] [2022-07-13 14:25:10,388 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 14:25:10,389 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 101 [2022-07-13 14:25:10,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 14:25:10,588 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-13 14:25:10,589 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:927) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:120) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 61 more [2022-07-13 14:25:10,591 INFO L158 Benchmark]: Toolchain (without parser) took 266771.61ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 37.4MB in the beginning and 59.2MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:25:10,591 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:25:10,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.84ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 40.7MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:25:10,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.20ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 39.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:25:10,592 INFO L158 Benchmark]: Boogie Preprocessor took 15.94ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:25:10,592 INFO L158 Benchmark]: RCFGBuilder took 7555.15ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 27.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 14:25:10,592 INFO L158 Benchmark]: TraceAbstraction took 258949.74ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 27.3MB in the beginning and 59.2MB in the end (delta: -31.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:25:10,593 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.19ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.84ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 40.7MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.20ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 39.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.94ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 7555.15ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 27.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 258949.74ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 27.3MB in the beginning and 59.2MB in the end (delta: -31.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")