./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0662b.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 0581f7e65f7fbcebfedbe5af78720fafbc68f000cf762482d99878eadfaec4df --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:37:24,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:37:24,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:37:24,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:37:24,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:37:24,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:37:24,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:37:24,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:37:24,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:37:24,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:37:24,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:37:24,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:37:24,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:37:24,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:37:24,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:37:24,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:37:24,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:37:24,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:37:24,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:37:24,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:37:24,826 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:37:24,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:37:24,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:37:24,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:37:24,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:37:24,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:37:24,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:37:24,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:37:24,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:37:24,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:37:24,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:37:24,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:37:24,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:37:24,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:37:24,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:37:24,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:37:24,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:37:24,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:37:24,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:37:24,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:37:24,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:37:24,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:37:24,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:37:24,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:37:24,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:37:24,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:37:24,886 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:37:24,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:37:24,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:37:24,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:37:24,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:37:24,888 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:37:24,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:37:24,889 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:37:24,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:37:24,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:37:24,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:37:24,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:37:24,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:37:24,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:37:24,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:37:24,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:37:24,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:37:24,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:37:24,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:37:24,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:37:24,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:37:24,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:24,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:37:24,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:37:24,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:37:24,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:37:24,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:37:24,893 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:37:24,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:37:24,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:37:24,894 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 -> 0581f7e65f7fbcebfedbe5af78720fafbc68f000cf762482d99878eadfaec4df [2022-07-21 01:37:25,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:37:25,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:37:25,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:37:25,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:37:25,232 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:37:25,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2022-07-21 01:37:25,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f1b5e2/bb09161245714ab886e06330e93544da/FLAGd25b6d17f [2022-07-21 01:37:25,673 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:37:25,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2022-07-21 01:37:25,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f1b5e2/bb09161245714ab886e06330e93544da/FLAGd25b6d17f [2022-07-21 01:37:25,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f1b5e2/bb09161245714ab886e06330e93544da [2022-07-21 01:37:25,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:37:25,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:37:25,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:25,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:37:25,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:37:25,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:25" (1/1) ... [2022-07-21 01:37:25,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b979bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:25, skipping insertion in model container [2022-07-21 01:37:25,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:25" (1/1) ... [2022-07-21 01:37:25,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:37:25,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:37:25,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c[6224,6237] [2022-07-21 01:37:25,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:25,965 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:37:26,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c[6224,6237] [2022-07-21 01:37:26,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:26,054 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:37:26,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26 WrapperNode [2022-07-21 01:37:26,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:26,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:26,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:37:26,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:37:26,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,122 INFO L137 Inliner]: procedures = 19, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2022-07-21 01:37:26,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:26,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:37:26,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:37:26,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:37:26,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:37:26,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:37:26,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:37:26,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:37:26,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (1/1) ... [2022-07-21 01:37:26,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:26,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:37:26,232 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-21 01:37:26,247 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-21 01:37:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:37:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:37:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:37:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-21 01:37:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:37:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-21 01:37:26,275 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-21 01:37:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-21 01:37:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-21 01:37:26,276 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-21 01:37:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:37:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:37:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:37:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-21 01:37:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:37:26,432 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:37:26,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:37:26,946 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:37:26,952 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:37:26,954 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-21 01:37:26,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:26 BoogieIcfgContainer [2022-07-21 01:37:26,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:37:26,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:37:26,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:37:26,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:37:26,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:37:25" (1/3) ... [2022-07-21 01:37:26,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d7bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:26, skipping insertion in model container [2022-07-21 01:37:26,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:26" (2/3) ... [2022-07-21 01:37:26,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d7bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:26, skipping insertion in model container [2022-07-21 01:37:26,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:26" (3/3) ... [2022-07-21 01:37:26,982 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2022-07-21 01:37:26,995 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:37:26,995 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:37:27,040 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:37:27,046 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@5f89cb6b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6edf9f3b [2022-07-21 01:37:27,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:37:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 100 states have internal predecessors, (172), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:37:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:37:27,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:27,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:27,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1187241542, now seen corresponding path program 1 times [2022-07-21 01:37:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:37:27,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644089491] [2022-07-21 01:37:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:37:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:27,235 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-21 01:37:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:37:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644089491] [2022-07-21 01:37:27,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644089491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:37:27,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:37:27,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:37:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128206213] [2022-07-21 01:37:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:37:27,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:37:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:37:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:37:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:27,278 INFO L87 Difference]: Start difference. First operand has 107 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 100 states have internal predecessors, (172), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:37:27,326 INFO L93 Difference]: Finished difference Result 211 states and 360 transitions. [2022-07-21 01:37:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:37:27,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 01:37:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:37:27,336 INFO L225 Difference]: With dead ends: 211 [2022-07-21 01:37:27,336 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 01:37:27,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:27,344 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:37:27,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:37:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 01:37:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-21 01:37:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.5) internal successors, (144), 96 states have internal predecessors, (144), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:37:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2022-07-21 01:37:27,405 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 11 [2022-07-21 01:37:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:37:27,405 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2022-07-21 01:37:27,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2022-07-21 01:37:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:37:27,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:27,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:27,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:37:27,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1076214830, now seen corresponding path program 1 times [2022-07-21 01:37:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:37:27,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645796180] [2022-07-21 01:37:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:37:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:37:27,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:37:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:37:27,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:37:27,724 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:37:27,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:37:27,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:37:27,729 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 01:37:27,732 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:37:27,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:37:27 BoogieIcfgContainer [2022-07-21 01:37:27,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:37:27,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:37:27,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:37:27,759 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:37:27,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:26" (3/4) ... [2022-07-21 01:37:27,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:37:27,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:37:27,762 INFO L158 Benchmark]: Toolchain (without parser) took 2060.25ms. Allocated memory was 50.3MB in the beginning and 81.8MB in the end (delta: 31.5MB). Free memory was 27.1MB in the beginning and 46.4MB in the end (delta: -19.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,762 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 50.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:37:27,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.97ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.9MB in the beginning and 39.8MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.19ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 36.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,764 INFO L158 Benchmark]: Boogie Preprocessor took 78.81ms. Allocated memory is still 60.8MB. Free memory was 36.3MB in the beginning and 33.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,764 INFO L158 Benchmark]: RCFGBuilder took 757.38ms. Allocated memory is still 60.8MB. Free memory was 32.9MB in the beginning and 34.8MB in the end (delta: -1.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,765 INFO L158 Benchmark]: TraceAbstraction took 795.85ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 34.4MB in the beginning and 46.9MB in the end (delta: -12.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-21 01:37:27,765 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 81.8MB. Free memory was 46.9MB in the beginning and 46.4MB in the end (delta: 495.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:37:27,768 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.56ms. Allocated memory is still 50.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.97ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.9MB in the beginning and 39.8MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.19ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 36.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.81ms. Allocated memory is still 60.8MB. Free memory was 36.3MB in the beginning and 33.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.38ms. Allocated memory is still 60.8MB. Free memory was 32.9MB in the beginning and 34.8MB in the end (delta: -1.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 795.85ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 34.4MB in the beginning and 46.9MB in the end (delta: -12.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 81.8MB. Free memory was 46.9MB in the beginning and 46.4MB in the end (delta: 495.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 262]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 261. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L253] double x = 0.0; [L254] double y = __VERIFIER_nondet_double(); [L256] COND TRUE y < 0.0 [L258] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L150] ieee_double_shape_type ew_u; [L151] ew_u.value = (x) [L152] EXPR ew_u.parts.msw [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L157] ieee_double_shape_type ew_u; [L158] ew_u.value = (y) [L159] EXPR ew_u.parts.msw [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L258] RET, EXPR __ieee754_atan2(y, x) [L258] double res = __ieee754_atan2(y, x); [L261] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L262] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 157 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 01:37:27,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0662b.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 0581f7e65f7fbcebfedbe5af78720fafbc68f000cf762482d99878eadfaec4df --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:37:29,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:37:29,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:37:29,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:37:29,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:37:29,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:37:29,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:37:29,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:37:29,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:37:29,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:37:29,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:37:29,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:37:29,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:37:29,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:37:29,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:37:29,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:37:29,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:37:29,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:37:29,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:37:29,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:37:29,694 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:37:29,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:37:29,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:37:29,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:37:29,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:37:29,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:37:29,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:37:29,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:37:29,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:37:29,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:37:29,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:37:29,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:37:29,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:37:29,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:37:29,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:37:29,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:37:29,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:37:29,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:37:29,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:37:29,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:37:29,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:37:29,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:37:29,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:37:29,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:37:29,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:37:29,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:37:29,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:37:29,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:37:29,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:37:29,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:37:29,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:37:29,761 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:37:29,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:37:29,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:37:29,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:37:29,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:37:29,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:37:29,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:37:29,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:37:29,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:37:29,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:37:29,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:37:29,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:37:29,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:37:29,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:29,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:37:29,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:37:29,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:37:29,766 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:37:29,766 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:37:29,767 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:37:29,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:37:29,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:37:29,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:37:29,767 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 -> 0581f7e65f7fbcebfedbe5af78720fafbc68f000cf762482d99878eadfaec4df [2022-07-21 01:37:30,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:37:30,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:37:30,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:37:30,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:37:30,077 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:37:30,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2022-07-21 01:37:30,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce821655/5ba7eb931fb34b1e8c0c29348ad36f37/FLAGe90e97cd6 [2022-07-21 01:37:30,570 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:37:30,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c [2022-07-21 01:37:30,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce821655/5ba7eb931fb34b1e8c0c29348ad36f37/FLAGe90e97cd6 [2022-07-21 01:37:30,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce821655/5ba7eb931fb34b1e8c0c29348ad36f37 [2022-07-21 01:37:30,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:37:30,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:37:30,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:30,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:37:30,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:37:30,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:30" (1/1) ... [2022-07-21 01:37:30,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7942a27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:30, skipping insertion in model container [2022-07-21 01:37:30,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:30" (1/1) ... [2022-07-21 01:37:30,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:37:30,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:37:31,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c[6224,6237] [2022-07-21 01:37:31,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:31,166 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:37:31,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662b.c[6224,6237] [2022-07-21 01:37:31,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:31,221 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:37:31,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31 WrapperNode [2022-07-21 01:37:31,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:31,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:31,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:37:31,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:37:31,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,262 INFO L137 Inliner]: procedures = 22, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 228 [2022-07-21 01:37:31,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:31,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:37:31,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:37:31,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:37:31,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:37:31,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:37:31,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:37:31,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:37:31,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (1/1) ... [2022-07-21 01:37:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:31,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:37:31,332 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-21 01:37:31,345 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-21 01:37:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:37:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-21 01:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-21 01:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-21 01:37:31,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-21 01:37:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-21 01:37:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-21 01:37:31,374 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-21 01:37:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:37:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:37:31,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:37:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:37:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:37:31,513 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:37:31,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:37:53,572 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:37:53,578 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:37:53,578 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-21 01:37:53,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:53 BoogieIcfgContainer [2022-07-21 01:37:53,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:37:53,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:37:53,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:37:53,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:37:53,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:37:30" (1/3) ... [2022-07-21 01:37:53,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee92c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:53, skipping insertion in model container [2022-07-21 01:37:53,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:31" (2/3) ... [2022-07-21 01:37:53,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee92c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:53, skipping insertion in model container [2022-07-21 01:37:53,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:53" (3/3) ... [2022-07-21 01:37:53,586 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b.c [2022-07-21 01:37:53,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:37:53,598 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:37:53,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:37:53,641 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@1a3b9550, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@302084ea [2022-07-21 01:37:53,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:37:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 87 states have internal predecessors, (143), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:37:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:37:53,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:53,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:53,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2113749773, now seen corresponding path program 1 times [2022-07-21 01:37:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:37:53,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307489675] [2022-07-21 01:37:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:37:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:37:53,679 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-21 01:37:53,683 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-21 01:37:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:53,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:37:53,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:37:54,011 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-21 01:37:54,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:37:54,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:37:54,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307489675] [2022-07-21 01:37:54,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307489675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:37:54,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:37:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:37:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360367730] [2022-07-21 01:37:54,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:37:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:37:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:37:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:37:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:54,042 INFO L87 Difference]: Start difference. First operand has 94 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 87 states have internal predecessors, (143), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:37:54,068 INFO L93 Difference]: Finished difference Result 185 states and 302 transitions. [2022-07-21 01:37:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:37:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 01:37:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:37:54,077 INFO L225 Difference]: With dead ends: 185 [2022-07-21 01:37:54,077 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 01:37:54,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:54,083 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:37:54,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:37:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 01:37:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 01:37:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:37:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2022-07-21 01:37:54,120 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 11 [2022-07-21 01:37:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:37:54,120 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2022-07-21 01:37:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2022-07-21 01:37:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:37:54,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:54,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:54,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:37:54,341 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-21 01:37:54,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -177099114, now seen corresponding path program 1 times [2022-07-21 01:37:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:37:54,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648921026] [2022-07-21 01:37:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:37:54,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:37:54,345 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-21 01:37:54,347 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-21 01:37:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:54,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 01:37:54,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:37:55,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-21 01:37:58,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-21 01:38:02,107 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-21 01:38:02,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:38:02,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:38:02,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648921026] [2022-07-21 01:38:02,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648921026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:38:02,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:38:02,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:38:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146130633] [2022-07-21 01:38:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:38:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:38:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:38:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:38:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2022-07-21 01:38:02,112 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:38:06,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:38:06,265 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2022-07-21 01:38:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:38:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-21 01:38:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:38:06,481 INFO L225 Difference]: With dead ends: 94 [2022-07-21 01:38:06,481 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 01:38:06,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2022-07-21 01:38:06,482 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 01:38:06,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 786 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 71 Unchecked, 2.9s Time] [2022-07-21 01:38:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 01:38:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 01:38:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:38:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2022-07-21 01:38:06,497 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 13 [2022-07-21 01:38:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:38:06,497 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-21 01:38:06,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:38:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2022-07-21 01:38:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:38:06,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:38:06,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:38:06,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:38:06,703 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-21 01:38:06,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:38:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:38:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1590624253, now seen corresponding path program 1 times [2022-07-21 01:38:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:38:06,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507962366] [2022-07-21 01:38:06,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:38:06,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:38:06,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:38:06,707 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-21 01:38:06,709 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-21 01:38:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:38:07,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:38:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:38:08,566 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-21 01:38:08,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:38:08,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:38:08,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507962366] [2022-07-21 01:38:08,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507962366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:38:08,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:38:08,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:38:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704245358] [2022-07-21 01:38:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:38:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:38:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:38:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:38:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:38:08,568 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 01:38:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:38:08,851 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2022-07-21 01:38:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:38:08,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-07-21 01:38:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:38:08,854 INFO L225 Difference]: With dead ends: 99 [2022-07-21 01:38:08,854 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 01:38:08,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:38:08,855 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:38:08,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-21 01:38:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 01:38:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-07-21 01:38:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:38:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2022-07-21 01:38:08,869 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 18 [2022-07-21 01:38:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:38:08,869 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2022-07-21 01:38:08,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 01:38:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-07-21 01:38:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:38:08,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:38:08,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:38:08,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 01:38:09,087 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-21 01:38:09,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:38:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:38:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1588777211, now seen corresponding path program 1 times [2022-07-21 01:38:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:38:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52488460] [2022-07-21 01:38:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:38:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:38:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:38:09,091 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-21 01:38:09,093 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-21 01:38:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:38:09,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:38:09,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:38:14,525 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-21 01:38:14,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:38:14,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:38:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52488460] [2022-07-21 01:38:14,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52488460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:38:14,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:38:14,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:38:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278911822] [2022-07-21 01:38:14,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:38:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:38:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:38:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:38:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:38:14,527 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:38:19,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:26,674 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-21 01:38:28,677 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-21 01:38:30,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:33,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:39,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:41,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:43,548 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-21 01:38:45,571 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-21 01:38:47,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:50,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:53,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:55,375 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-21 01:38:57,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:00,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:03,341 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-21 01:39:06,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:09,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:10,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:10,618 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2022-07-21 01:39:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:39:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-07-21 01:39:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:10,622 INFO L225 Difference]: With dead ends: 97 [2022-07-21 01:39:10,622 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 01:39:10,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:39:10,623 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 105 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:10,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 367 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 52.3s Time] [2022-07-21 01:39:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 01:39:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-21 01:39:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:39:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2022-07-21 01:39:10,633 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 18 [2022-07-21 01:39:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:10,633 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2022-07-21 01:39:10,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:39:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2022-07-21 01:39:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:39:10,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:10,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:39:10,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:39:10,835 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-21 01:39:10,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -809284995, now seen corresponding path program 1 times [2022-07-21 01:39:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090680698] [2022-07-21 01:39:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:10,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:39:10,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 01:39:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:11,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:39:11,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:14,089 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-21 01:39:14,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:14,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090680698] [2022-07-21 01:39:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090680698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:14,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:39:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031004088] [2022-07-21 01:39:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:14,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:39:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:39:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:39:14,092 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-21 01:39:17,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:18,119 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2022-07-21 01:39:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:39:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-07-21 01:39:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:18,121 INFO L225 Difference]: With dead ends: 161 [2022-07-21 01:39:18,121 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 01:39:18,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:39:18,123 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:18,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 537 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 1 Unknown, 33 Unchecked, 3.6s Time] [2022-07-21 01:39:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 01:39:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-21 01:39:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:39:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2022-07-21 01:39:18,137 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 18 [2022-07-21 01:39:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:18,137 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2022-07-21 01:39:18,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-21 01:39:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2022-07-21 01:39:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:39:18,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:18,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:39:18,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:39:18,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:39:18,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -752026693, now seen corresponding path program 1 times [2022-07-21 01:39:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:18,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973446031] [2022-07-21 01:39:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:18,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:39:18,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 01:39:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:18,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:39:18,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:20,613 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-21 01:39:20,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:20,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:20,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973446031] [2022-07-21 01:39:20,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973446031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:20,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:20,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:39:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712841370] [2022-07-21 01:39:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:20,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:39:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:39:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:39:20,615 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:39:25,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:25,518 INFO L93 Difference]: Finished difference Result 160 states and 223 transitions. [2022-07-21 01:39:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:39:25,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-07-21 01:39:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:25,741 INFO L225 Difference]: With dead ends: 160 [2022-07-21 01:39:25,741 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 01:39:25,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2022-07-21 01:39:25,743 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 7 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:25,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 16 Unchecked, 2.6s Time] [2022-07-21 01:39:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 01:39:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-21 01:39:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:39:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-07-21 01:39:25,752 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 18 [2022-07-21 01:39:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:25,752 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-07-21 01:39:25,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:39:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-07-21 01:39:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:39:25,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:25,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:39:25,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 01:39:25,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:39:25,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1689344753, now seen corresponding path program 1 times [2022-07-21 01:39:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:25,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462257572] [2022-07-21 01:39:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:25,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:39:25,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 01:39:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:26,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:39:26,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:28,862 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-21 01:39:28,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:28,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:28,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462257572] [2022-07-21 01:39:28,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462257572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:28,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:28,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:39:28,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628405269] [2022-07-21 01:39:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:28,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:39:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:28,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:39:28,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:39:28,864 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-21 01:39:32,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:32,230 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2022-07-21 01:39:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:39:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Word has length 19 [2022-07-21 01:39:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:32,454 INFO L225 Difference]: With dead ends: 141 [2022-07-21 01:39:32,454 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 01:39:32,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:39:32,455 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 10 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:32,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 424 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 12 Unchecked, 2.6s Time] [2022-07-21 01:39:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 01:39:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-07-21 01:39:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:39:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2022-07-21 01:39:32,461 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 19 [2022-07-21 01:39:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:32,462 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2022-07-21 01:39:32,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-21 01:39:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-07-21 01:39:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:39:32,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:32,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:39:32,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:39:32,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:39:32,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 590719438, now seen corresponding path program 1 times [2022-07-21 01:39:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:32,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540593257] [2022-07-21 01:39:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:32,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:39:32,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 01:39:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:32,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:39:32,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:39,765 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-21 01:39:39,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:39,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:39,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540593257] [2022-07-21 01:39:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540593257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:39,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:39:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255672260] [2022-07-21 01:39:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:39:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:39:39,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:39:39,767 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-21 01:39:43,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:49,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:51,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:53,483 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-21 01:40:01,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:03,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:05,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:07,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:10,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:12,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:14,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:17,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:20,868 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-21 01:40:23,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:26,789 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-21 01:40:28,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:28,660 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-07-21 01:40:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:40:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 01:40:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:28,663 INFO L225 Difference]: With dead ends: 79 [2022-07-21 01:40:28,663 INFO L226 Difference]: Without dead ends: 74 [2022-07-21 01:40:28,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:40:28,663 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:28,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 267 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 13 Unknown, 0 Unchecked, 44.8s Time] [2022-07-21 01:40:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-21 01:40:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-07-21 01:40:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:40:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-07-21 01:40:28,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 20 [2022-07-21 01:40:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:28,673 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-07-21 01:40:28,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-21 01:40:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-07-21 01:40:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:40:28,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:28,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:40:28,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 01:40:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:40:28,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 592566480, now seen corresponding path program 1 times [2022-07-21 01:40:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280008724] [2022-07-21 01:40:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:28,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:40:28,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 01:40:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:40:29,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:40:29,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:40:31,117 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-21 01:40:31,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:40:31,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:40:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280008724] [2022-07-21 01:40:31,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280008724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:40:31,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:40:31,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:40:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073849132] [2022-07-21 01:40:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:40:31,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:40:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:40:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:40:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:40:31,119 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 01:40:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:31,452 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-21 01:40:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:40:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 01:40:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:31,452 INFO L225 Difference]: With dead ends: 75 [2022-07-21 01:40:31,452 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 01:40:31,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:40:31,453 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:31,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-07-21 01:40:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 01:40:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-21 01:40:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:40:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-07-21 01:40:31,459 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 20 [2022-07-21 01:40:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:31,459 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-07-21 01:40:31,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 01:40:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-07-21 01:40:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 01:40:31,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:31,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:40:31,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 01:40:31,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:40:31,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 802050970, now seen corresponding path program 1 times [2022-07-21 01:40:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:31,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13604980] [2022-07-21 01:40:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:31,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:31,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:31,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:40:31,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 01:40:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:40:31,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 01:40:31,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:40:40,405 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-21 01:40:40,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:40:40,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:40:40,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13604980] [2022-07-21 01:40:40,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13604980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:40:40,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:40:40,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:40:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874752337] [2022-07-21 01:40:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:40:40,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:40:40,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:40:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:40:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2022-07-21 01:40:40,407 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-21 01:40:43,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:45,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:45,557 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-07-21 01:40:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:40:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 01:40:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:45,559 INFO L225 Difference]: With dead ends: 73 [2022-07-21 01:40:45,559 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 01:40:45,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=19, Invalid=52, Unknown=1, NotChecked=0, Total=72 [2022-07-21 01:40:45,561 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:45,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 369 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 2 Unknown, 20 Unchecked, 4.7s Time] [2022-07-21 01:40:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 01:40:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-21 01:40:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:40:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-07-21 01:40:45,570 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 21 [2022-07-21 01:40:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:45,571 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-07-21 01:40:45,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-21 01:40:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-07-21 01:40:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 01:40:45,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:45,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:40:45,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 01:40:45,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:40:45,784 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2015754869, now seen corresponding path program 1 times [2022-07-21 01:40:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:45,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61222131] [2022-07-21 01:40:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:45,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:40:45,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 01:40:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:40:46,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:40:46,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:40:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:40:52,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:40:52,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:40:52,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61222131] [2022-07-21 01:40:52,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61222131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:40:52,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:40:52,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:40:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963909804] [2022-07-21 01:40:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:40:52,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:40:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:40:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:40:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:40:52,367 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:40:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:53,485 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-07-21 01:40:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:40:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 01:40:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:53,489 INFO L225 Difference]: With dead ends: 77 [2022-07-21 01:40:53,489 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 01:40:53,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:40:53,490 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 18 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:53,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 435 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-07-21 01:40:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 01:40:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-07-21 01:40:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:40:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2022-07-21 01:40:53,496 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 23 [2022-07-21 01:40:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:53,497 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2022-07-21 01:40:53,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:40:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-07-21 01:40:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 01:40:53,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:53,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:40:53,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 01:40:53,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:40:53,712 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 497810342, now seen corresponding path program 1 times [2022-07-21 01:40:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943992814] [2022-07-21 01:40:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:53,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:53,714 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:40:53,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 01:40:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:40:54,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:40:54,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:40:55,985 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-21 01:40:55,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:40:55,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:40:55,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943992814] [2022-07-21 01:40:55,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943992814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:40:55,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:40:55,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:40:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464917425] [2022-07-21 01:40:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:40:55,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:40:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:40:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:40:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:40:55,988 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:40:59,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:59,452 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-07-21 01:40:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:40:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-21 01:40:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:59,759 INFO L225 Difference]: With dead ends: 102 [2022-07-21 01:40:59,759 INFO L226 Difference]: Without dead ends: 64 [2022-07-21 01:40:59,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:40:59,760 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:59,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 5 Unchecked, 2.8s Time] [2022-07-21 01:40:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-21 01:40:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-21 01:40:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 01:40:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-07-21 01:40:59,765 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 26 [2022-07-21 01:40:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:59,765 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-07-21 01:40:59,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:40:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-07-21 01:40:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 01:40:59,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:59,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:40:59,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 01:40:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:40:59,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1514375320, now seen corresponding path program 1 times [2022-07-21 01:40:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:59,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649737376] [2022-07-21 01:40:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:59,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:40:59,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 01:41:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:00,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:41:00,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:03,862 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-21 01:41:03,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:03,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:03,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649737376] [2022-07-21 01:41:03,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649737376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:03,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:03,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:41:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332430409] [2022-07-21 01:41:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:03,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:41:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:41:03,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:41:03,864 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-21 01:41:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:04,730 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-07-21 01:41:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:41:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2022-07-21 01:41:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:04,731 INFO L225 Difference]: With dead ends: 64 [2022-07-21 01:41:04,731 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:41:04,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:41:04,738 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:04,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-07-21 01:41:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:41:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:41:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:41:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:41:04,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-07-21 01:41:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:04,740 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:41:04,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-21 01:41:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:41:04,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:41:04,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:41:04,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-21 01:41:04,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:04,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-21 01:41:11,074 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-21 01:41:11,074 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-21 01:41:11,074 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-21 01:41:11,075 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L902 garLoopResultBuilder]: At program point L267(lines 246 268) the Hoare annotation is: true [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-21 01:41:11,076 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-21 01:41:11,077 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L895 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_70| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_70|) |ULTIMATE.start___ieee754_atan2_~lx~0#1|) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_70|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_70|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_70|))) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_70|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (exists ((|v_skolemized_q#valueAsBitvector_58| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_58|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_58|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_58|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_58|) |ULTIMATE.start___ieee754_atan2_~hx~1#1|))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_23| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6|) (_ bv4 32)))) (and (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_23|)) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) .cse0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_23|)) (_ +zero 11 53)))))) [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 265) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L256-2(lines 256 265) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-21 01:41:11,078 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 264) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L262(line 262) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-21 01:41:11,079 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= (_ +zero 11 53) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_atan2_~x#1|)) [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-21 01:41:11,080 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-21 01:41:11,081 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-21 01:41:11,081 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-21 01:41:11,085 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:41:11,087 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:41:11,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,107 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:41:11 BoogieIcfgContainer [2022-07-21 01:41:11,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:41:11,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:41:11,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:41:11,113 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:41:11,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:53" (3/4) ... [2022-07-21 01:41:11,116 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 01:41:11,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-21 01:41:11,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-21 01:41:11,127 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-21 01:41:11,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-21 01:41:11,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 01:41:11,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 01:41:11,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_70 : bv64 :: (v_skolemized_q#valueAsBitvector_70[31:0] == lx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_70[63:63], v_skolemized_q#valueAsBitvector_70[62:52], v_skolemized_q#valueAsBitvector_70[51:0])) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_70[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && (\exists v_skolemized_q#valueAsBitvector_58 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_58[63:63], v_skolemized_q#valueAsBitvector_58[62:52], v_skolemized_q#valueAsBitvector_58[51:0]) && v_skolemized_q#valueAsBitvector_58[63:32] == hx)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_23[63:32] && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32])) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~Pluszero~LONGDOUBLE()) [2022-07-21 01:41:11,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) [2022-07-21 01:41:11,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 01:41:11,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:41:11,176 INFO L158 Benchmark]: Toolchain (without parser) took 220237.61ms. Allocated memory is still 73.4MB. Free memory was 55.1MB in the beginning and 29.9MB in the end (delta: 25.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,177 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 73.4MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:41:11,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.92ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.08ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 49.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,177 INFO L158 Benchmark]: Boogie Preprocessor took 38.17ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,178 INFO L158 Benchmark]: RCFGBuilder took 22277.94ms. Allocated memory is still 73.4MB. Free memory was 46.8MB in the beginning and 40.5MB in the end (delta: 6.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,178 INFO L158 Benchmark]: TraceAbstraction took 197531.03ms. Allocated memory is still 73.4MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,178 INFO L158 Benchmark]: Witness Printer took 63.16ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 29.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 01:41:11,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 73.4MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.92ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.08ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 49.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.17ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 22277.94ms. Allocated memory is still 73.4MB. Free memory was 46.8MB in the beginning and 40.5MB in the end (delta: 6.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 197531.03ms. Allocated memory is still 73.4MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Witness Printer took 63.16ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 29.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 262]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 197.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 133.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 116.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 4559 SdHoareTripleChecker+Invalid, 111.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 192 IncrementalHoareTripleChecker+Unchecked, 3368 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1191 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 39.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 58 PreInvPairs, 63 NumberOfFragments, 138 HoareAnnotationTreeSize, 58 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 239 ConstructedInterpolants, 82 QuantifiedInterpolants, 2330 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1901 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 149]: Loop Invariant [2022-07-21 01:41:11,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && ~Pluszero~LONGDOUBLE() == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant [2022-07-21 01:41:11,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,209 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,210 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_70,QUANTIFIED] [2022-07-21 01:41:11,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,217 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_58,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:11,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:11,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] Derived loop invariant: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_70 : bv64 :: (v_skolemized_q#valueAsBitvector_70[31:0] == lx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_70[63:63], v_skolemized_q#valueAsBitvector_70[62:52], v_skolemized_q#valueAsBitvector_70[51:0])) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_70[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && (\exists v_skolemized_q#valueAsBitvector_58 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_58[63:63], v_skolemized_q#valueAsBitvector_58[62:52], v_skolemized_q#valueAsBitvector_58[51:0]) && v_skolemized_q#valueAsBitvector_58[63:32] == hx)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_23[63:32] && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32])) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:11,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 01:41:11,439 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-21 01:41:11,553 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE