./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0682a.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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:37:33,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:37:33,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:37:33,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:37:33,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:37:33,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:37:33,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:37:33,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:37:33,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:37:33,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:37:33,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:37:33,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:37:33,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:37:33,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:37:33,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:37:33,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:37:33,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:37:33,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:37:33,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:37:33,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:37:33,455 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:37:33,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:37:33,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:37:33,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:37:33,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:37:33,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:37:33,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:37:33,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:37:33,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:37:33,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:37:33,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:37:33,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:37:33,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:37:33,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:37:33,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:37:33,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:37:33,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:37:33,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:37:33,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:37:33,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:37:33,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:37:33,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:37:33,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:37:33,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:37:33,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:37:33,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:37:33,498 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:37:33,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:37:33,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:37:33,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:37:33,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:37:33,499 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:37:33,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:37:33,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:37:33,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:37:33,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:37:33,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:37:33,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:37:33,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:37:33,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:37:33,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:37:33,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:37:33,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:37:33,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:37:33,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:37:33,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:37:33,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:37:33,504 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:37:33,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:37:33,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:37:33,504 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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-07-13 14:37:33,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:37:33,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:37:33,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:37:33,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:37:33,748 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:37:33,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-13 14:37:33,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79f57e88/9278e06e3ee343568a69c480e94fbe53/FLAG89ca36166 [2022-07-13 14:37:34,107 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:37:34,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-13 14:37:34,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79f57e88/9278e06e3ee343568a69c480e94fbe53/FLAG89ca36166 [2022-07-13 14:37:34,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79f57e88/9278e06e3ee343568a69c480e94fbe53 [2022-07-13 14:37:34,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:37:34,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:37:34,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:37:34,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:37:34,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:37:34,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7472e722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34, skipping insertion in model container [2022-07-13 14:37:34,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:37:34,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:37:34,825 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_0682a.c[6875,6888] [2022-07-13 14:37:34,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:37:34,836 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:37:34,883 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_0682a.c[6875,6888] [2022-07-13 14:37:34,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:37:34,895 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:37:34,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34 WrapperNode [2022-07-13 14:37:34,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:37:34,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:37:34,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:37:34,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:37:34,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,941 INFO L137 Inliner]: procedures = 21, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 313 [2022-07-13 14:37:34,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:37:34,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:37:34,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:37:34,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:37:34,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:34,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:35,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:35,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:35,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:37:35,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:37:35,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:37:35,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:37:35,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (1/1) ... [2022-07-13 14:37:35,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:37:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:37:35,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:37:35,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:37:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:37:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:37:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:37:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:37:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:37:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-13 14:37:35,091 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-13 14:37:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:37:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-13 14:37:35,092 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-13 14:37:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:37:35,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:37:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:37:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 14:37:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:37:35,213 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:37:35,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:37:35,764 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:37:35,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:37:35,772 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-13 14:37:35,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:37:35 BoogieIcfgContainer [2022-07-13 14:37:35,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:37:35,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:37:35,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:37:35,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:37:35,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:37:34" (1/3) ... [2022-07-13 14:37:35,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934a82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:37:35, skipping insertion in model container [2022-07-13 14:37:35,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:34" (2/3) ... [2022-07-13 14:37:35,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934a82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:37:35, skipping insertion in model container [2022-07-13 14:37:35,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:37:35" (3/3) ... [2022-07-13 14:37:35,781 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-07-13 14:37:35,790 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:37:35,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:37:35,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:37:35,842 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@2dad16ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6134b3e5 [2022-07-13 14:37:35,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:37:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 109 states have internal predecessors, (186), 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-13 14:37:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:37:35,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:37:35,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:37:35,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:37:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:37:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash 334403016, now seen corresponding path program 1 times [2022-07-13 14:37:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:37:35,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369332999] [2022-07-13 14:37:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:37:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:37:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:37:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:37:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:37:36,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369332999] [2022-07-13 14:37:36,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369332999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:37:36,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:37:36,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:37:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112938196] [2022-07-13 14:37:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:37:36,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:37:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:37:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:37:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:37:36,074 INFO L87 Difference]: Start difference. First operand has 116 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 109 states have internal predecessors, (186), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:37:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:37:36,118 INFO L93 Difference]: Finished difference Result 230 states and 390 transitions. [2022-07-13 14:37:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:37:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 14:37:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:37:36,127 INFO L225 Difference]: With dead ends: 230 [2022-07-13 14:37:36,127 INFO L226 Difference]: Without dead ends: 112 [2022-07-13 14:37:36,130 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-13 14:37:36,133 INFO L413 NwaCegarLoop]: 167 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, 167 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-13 14:37:36,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:37:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-13 14:37:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-13 14:37:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 105 states have internal predecessors, (154), 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-13 14:37:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2022-07-13 14:37:36,194 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 15 [2022-07-13 14:37:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:37:36,194 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2022-07-13 14:37:36,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:37:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2022-07-13 14:37:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:37:36,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:37:36,196 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-13 14:37:36,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:37:36,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:37:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:37:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1239810759, now seen corresponding path program 1 times [2022-07-13 14:37:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:37:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640989731] [2022-07-13 14:37:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:37:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:37:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:37:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:37:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:37:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640989731] [2022-07-13 14:37:36,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640989731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:37:36,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:37:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:37:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253463640] [2022-07-13 14:37:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:37:36,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:37:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:37:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:37:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:37:36,441 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:37:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:37:36,460 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2022-07-13 14:37:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:37:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:37:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:37:36,464 INFO L225 Difference]: With dead ends: 213 [2022-07-13 14:37:36,465 INFO L226 Difference]: Without dead ends: 112 [2022-07-13 14:37:36,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:37:36,470 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:37:36,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:37:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-13 14:37:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-13 14:37:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.457142857142857) internal successors, (153), 105 states have internal predecessors, (153), 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-13 14:37:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2022-07-13 14:37:36,482 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 18 [2022-07-13 14:37:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:37:36,483 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2022-07-13 14:37:36,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:37:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2022-07-13 14:37:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:37:36,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:37:36,488 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] [2022-07-13 14:37:36,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:37:36,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:37:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:37:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash -386906492, now seen corresponding path program 1 times [2022-07-13 14:37:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:37:36,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668803755] [2022-07-13 14:37:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:37:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:37:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:37:36,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:37:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:37:37,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:37:37,114 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:37:37,115 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:37:37,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:37:37,119 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 14:37:37,122 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:37:37,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:37:37 BoogieIcfgContainer [2022-07-13 14:37:37,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:37:37,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:37:37,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:37:37,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:37:37,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:37:35" (3/4) ... [2022-07-13 14:37:37,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:37:37,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:37:37,178 INFO L158 Benchmark]: Toolchain (without parser) took 2642.17ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 125.5MB in the beginning and 141.5MB in the end (delta: -16.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,179 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:37:37,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 123.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 118.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,185 INFO L158 Benchmark]: Boogie Preprocessor took 86.56ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 113.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,187 INFO L158 Benchmark]: RCFGBuilder took 744.62ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 125.2MB in the end (delta: -11.3MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,187 INFO L158 Benchmark]: TraceAbstraction took 1398.29ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 124.5MB in the beginning and 141.5MB in the end (delta: -16.9MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2022-07-13 14:37:37,187 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 197.1MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:37:37,189 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 123.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 118.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.56ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 113.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 744.62ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 125.2MB in the end (delta: -11.3MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1398.29ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 124.5MB in the beginning and 141.5MB in the end (delta: -16.9MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 197.1MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 287]: 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 bitwiseAnd at line 268, overapproximation of someBinaryDOUBLEComparisonOperation at line 286. 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] [L278] double x = -1.0 / 0.0; [L279] double y = __VERIFIER_nondet_double(); [L281] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L250] ieee_double_shape_type ew_u; [L251] ew_u.value = (x) [L252] EXPR ew_u.parts.msw [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw [L253] (lx) = ew_u.parts.lsw [L255] hx &= 0x7fffffff [L256] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L257] hx = 0x7ff00000 - hx [L258] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=4293918720, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L281] RET, EXPR isinf_double(x) [L281] EXPR isinf_double(x) && isfinite_double(y) [L281] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L264] ieee_double_shape_type gh_u; [L265] gh_u.value = (x) [L266] EXPR gh_u.parts.msw [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-3, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] RET, EXPR isfinite_double(y) [L281] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isfinite_double(y)=1, isinf_double(x)=1, isinf_double(x) && isfinite_double(y)=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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] COND TRUE isinf_double(x) && isfinite_double(y) && y < 0.0 [L283] 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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=0, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, 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=0, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L283] RET, EXPR __ieee754_atan2(y, x) [L283] double res = __ieee754_atan2(y, x); [L286] COND TRUE res != -pi 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L287] 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, 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, 485 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 329 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 14:37:37,232 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_0682a.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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:37:39,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:37:39,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:37:39,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:37:39,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:37:39,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:37:39,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:37:39,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:37:39,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:37:39,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:37:39,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:37:39,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:37:39,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:37:39,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:37:39,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:37:39,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:37:39,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:37:39,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:37:39,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:37:39,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:37:39,312 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:37:39,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:37:39,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:37:39,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:37:39,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:37:39,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:37:39,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:37:39,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:37:39,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:37:39,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:37:39,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:37:39,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:37:39,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:37:39,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:37:39,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:37:39,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:37:39,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:37:39,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:37:39,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:37:39,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:37:39,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:37:39,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:37:39,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:37:39,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:37:39,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:37:39,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:37:39,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:37:39,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:37:39,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:37:39,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:37:39,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:37:39,365 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:37:39,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:37:39,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:37:39,367 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:37:39,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:37:39,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:37:39,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:37:39,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:37:39,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:37:39,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:37:39,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:37:39,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:37:39,370 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:37:39,370 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:37:39,371 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:37:39,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:37:39,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:37:39,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:37:39,372 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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-07-13 14:37:39,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:37:39,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:37:39,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:37:39,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:37:39,702 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:37:39,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-13 14:37:39,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953f647d4/0059b457dcdb486ca74d70df0e895365/FLAG9e282516b [2022-07-13 14:37:40,161 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:37:40,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-13 14:37:40,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953f647d4/0059b457dcdb486ca74d70df0e895365/FLAG9e282516b [2022-07-13 14:37:40,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953f647d4/0059b457dcdb486ca74d70df0e895365 [2022-07-13 14:37:40,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:37:40,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:37:40,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:37:40,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:37:40,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:37:40,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10322d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40, skipping insertion in model container [2022-07-13 14:37:40,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:37:40,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:37:40,460 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_0682a.c[6875,6888] [2022-07-13 14:37:40,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:37:40,480 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:37:40,545 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_0682a.c[6875,6888] [2022-07-13 14:37:40,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:37:40,568 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:37:40,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40 WrapperNode [2022-07-13 14:37:40,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:37:40,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:37:40,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:37:40,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:37:40,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,636 INFO L137 Inliner]: procedures = 24, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2022-07-13 14:37:40,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:37:40,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:37:40,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:37:40,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:37:40,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:37:40,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:37:40,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:37:40,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:37:40,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (1/1) ... [2022-07-13 14:37:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:37:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:37:40,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:37:40,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:37:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-13 14:37:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-13 14:37:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-13 14:37:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-13 14:37:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-13 14:37:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:37:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:37:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:37:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:37:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:37:40,940 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:37:40,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:38:04,866 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:38:04,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:38:04,870 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-13 14:38:04,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:38:04 BoogieIcfgContainer [2022-07-13 14:38:04,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:38:04,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:38:04,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:38:04,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:38:04,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:37:40" (1/3) ... [2022-07-13 14:38:04,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:38:04, skipping insertion in model container [2022-07-13 14:38:04,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:37:40" (2/3) ... [2022-07-13 14:38:04,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f14617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:38:04, skipping insertion in model container [2022-07-13 14:38:04,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:38:04" (3/3) ... [2022-07-13 14:38:04,879 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-07-13 14:38:04,888 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:38:04,889 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:38:04,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:38:04,935 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@56393411, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fbc4461 [2022-07-13 14:38:04,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:38:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 96 states have internal predecessors, (157), 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-13 14:38:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:38:04,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:04,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:38:04,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash -233161701, now seen corresponding path program 1 times [2022-07-13 14:38:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:04,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651167202] [2022-07-13 14:38:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:04,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:04,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:04,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:38:05,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 14:38:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:05,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:38:05,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:05,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:05,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651167202] [2022-07-13 14:38:05,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651167202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:05,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:05,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:38:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411705623] [2022-07-13 14:38:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:38:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:38:05,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:38:05,414 INFO L87 Difference]: Start difference. First operand has 103 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 96 states have internal predecessors, (157), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:05,451 INFO L93 Difference]: Finished difference Result 204 states and 332 transitions. [2022-07-13 14:38:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:38:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 14:38:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:05,459 INFO L225 Difference]: With dead ends: 204 [2022-07-13 14:38:05,459 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 14:38:05,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-13 14:38:05,467 INFO L413 NwaCegarLoop]: 144 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, 144 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-13 14:38:05,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:38:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 14:38:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-13 14:38:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 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-13 14:38:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2022-07-13 14:38:05,500 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 15 [2022-07-13 14:38:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:05,500 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2022-07-13 14:38:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2022-07-13 14:38:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:38:05,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:05,501 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-13 14:38:05,519 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-13 14:38:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:38:05,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -114752879, now seen corresponding path program 1 times [2022-07-13 14:38:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:05,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704233159] [2022-07-13 14:38:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:05,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:38:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 14:38:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:06,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 14:38:06,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:06,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:06,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:06,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704233159] [2022-07-13 14:38:06,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704233159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:06,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:06,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:38:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228688528] [2022-07-13 14:38:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:06,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:38:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:38:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:38:06,289 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:38:06,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:06,466 INFO L93 Difference]: Finished difference Result 187 states and 266 transitions. [2022-07-13 14:38:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:38:06,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:38:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:06,468 INFO L225 Difference]: With dead ends: 187 [2022-07-13 14:38:06,468 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 14:38:06,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:38:06,470 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:06,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 14:38:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 14:38:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-13 14:38:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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-13 14:38:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-07-13 14:38:06,480 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 18 [2022-07-13 14:38:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:06,481 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-07-13 14:38:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 14:38:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-07-13 14:38:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:38:06,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:06,482 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] [2022-07-13 14:38:06,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 14:38:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:38:06,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2086328612, now seen corresponding path program 1 times [2022-07-13 14:38:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:06,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393999416] [2022-07-13 14:38:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:06,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:06,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:06,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:38:06,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 14:38:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:07,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-13 14:38:07,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:07,900 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-13 14:38:11,030 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-07-13 14:38:11,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2022-07-13 14:38:16,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:38:17,096 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-07-13 14:38:17,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-07-13 14:38:20,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:38:20,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2022-07-13 14:38:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:28,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:28,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393999416] [2022-07-13 14:38:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393999416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:28,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:28,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 14:38:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283610766] [2022-07-13 14:38:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:28,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 14:38:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 14:38:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=130, Unknown=2, NotChecked=0, Total=156 [2022-07-13 14:38:28,114 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:28,130 INFO L93 Difference]: Finished difference Result 103 states and 141 transitions. [2022-07-13 14:38:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 14:38:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 14:38:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:28,131 INFO L225 Difference]: With dead ends: 103 [2022-07-13 14:38:28,131 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 14:38:28,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=24, Invalid=130, Unknown=2, NotChecked=0, Total=156 [2022-07-13 14:38:28,133 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:28,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1372 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 153 Unchecked, 0.0s Time] [2022-07-13 14:38:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 14:38:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-13 14:38:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 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-13 14:38:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2022-07-13 14:38:28,140 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 22 [2022-07-13 14:38:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:28,140 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2022-07-13 14:38:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2022-07-13 14:38:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 14:38:28,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:28,142 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-13 14:38:28,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:38:28,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:38:28,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1752843547, now seen corresponding path program 1 times [2022-07-13 14:38:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227846386] [2022-07-13 14:38:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:28,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:38:28,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:38:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:28,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:38:28,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:31,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:31,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:31,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227846386] [2022-07-13 14:38:31,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227846386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:31,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:31,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:38:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639809307] [2022-07-13 14:38:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:31,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:38:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:38:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:38:31,992 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-13 14:38:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:32,727 INFO L93 Difference]: Finished difference Result 192 states and 273 transitions. [2022-07-13 14:38:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:38:32,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-13 14:38:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:32,729 INFO L225 Difference]: With dead ends: 192 [2022-07-13 14:38:32,729 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 14:38:32,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:38:32,733 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 22 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:32,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 739 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 33 Unchecked, 0.7s Time] [2022-07-13 14:38:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 14:38:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-07-13 14:38:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 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-13 14:38:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2022-07-13 14:38:32,757 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 27 [2022-07-13 14:38:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:32,757 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2022-07-13 14:38:32,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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-13 14:38:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2022-07-13 14:38:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 14:38:32,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:32,758 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-13 14:38:32,790 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-13 14:38:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:38:32,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1810101849, now seen corresponding path program 1 times [2022-07-13 14:38:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:32,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202511672] [2022-07-13 14:38:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:32,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:32,974 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-13 14:38:32,976 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-13 14:38:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:33,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:38:33,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:37,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:37,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202511672] [2022-07-13 14:38:37,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202511672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:37,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:37,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:38:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112474515] [2022-07-13 14:38:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:37,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:38:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:38:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:38:37,888 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-13 14:38:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:38,879 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2022-07-13 14:38:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:38:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-13 14:38:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:38,881 INFO L225 Difference]: With dead ends: 121 [2022-07-13 14:38:38,881 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 14:38:38,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:38:38,882 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 21 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:38,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 825 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 46 Unchecked, 1.0s Time] [2022-07-13 14:38:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 14:38:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-07-13 14:38:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 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-13 14:38:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2022-07-13 14:38:38,895 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 27 [2022-07-13 14:38:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:38,896 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2022-07-13 14:38:38,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-13 14:38:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2022-07-13 14:38:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 14:38:38,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:38,897 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-13 14:38:38,919 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-13 14:38:39,103 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-13 14:38:39,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -144061543, now seen corresponding path program 1 times [2022-07-13 14:38:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:39,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42865006] [2022-07-13 14:38:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:39,116 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-13 14:38:39,119 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-13 14:38:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:39,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:38:39,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:42,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:42,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:42,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42865006] [2022-07-13 14:38:42,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42865006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:42,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:42,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:38:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662172523] [2022-07-13 14:38:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:42,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:38:42,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:42,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:38:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:38:42,160 INFO L87 Difference]: Start difference. First operand 99 states and 135 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-13 14:38:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:42,165 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-07-13 14:38:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:38:42,165 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-13 14:38:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:42,166 INFO L225 Difference]: With dead ends: 107 [2022-07-13 14:38:42,166 INFO L226 Difference]: Without dead ends: 101 [2022-07-13 14:38:42,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:38:42,174 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 14 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:42,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 594 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-13 14:38:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-13 14:38:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-13 14:38:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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-13 14:38:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-07-13 14:38:42,192 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 27 [2022-07-13 14:38:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-07-13 14:38:42,193 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-13 14:38:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-07-13 14:38:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 14:38:42,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:42,195 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, 1] [2022-07-13 14:38:42,218 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-13 14:38:42,416 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-13 14:38:42,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 275809362, now seen corresponding path program 1 times [2022-07-13 14:38:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:42,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134392170] [2022-07-13 14:38:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:42,419 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-13 14:38:42,420 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-13 14:38:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:42,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 14:38:42,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:44,092 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-13 14:38:45,230 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 16 treesize of output 8 [2022-07-13 14:38:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:52,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:52,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:52,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134392170] [2022-07-13 14:38:52,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134392170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:52,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:52,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:38:52,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874836385] [2022-07-13 14:38:52,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:52,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 14:38:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 14:38:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:38:52,498 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:52,768 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2022-07-13 14:38:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:38:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 28 [2022-07-13 14:38:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:52,775 INFO L225 Difference]: With dead ends: 101 [2022-07-13 14:38:52,775 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 14:38:52,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:38:52,776 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:52,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 869 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 64 Unchecked, 0.3s Time] [2022-07-13 14:38:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 14:38:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-13 14:38:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 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-13 14:38:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2022-07-13 14:38:52,786 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 28 [2022-07-13 14:38:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:52,786 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2022-07-13 14:38:52,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-07-13 14:38:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 14:38:52,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:52,787 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, 1] [2022-07-13 14:38:52,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 14:38:52,988 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-13 14:38:52,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -489049033, now seen corresponding path program 1 times [2022-07-13 14:38:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:52,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182129144] [2022-07-13 14:38:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:52,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:52,991 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-13 14:38:52,993 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-13 14:38:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:53,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:38:53,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:38:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:38:56,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:38:56,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:38:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182129144] [2022-07-13 14:38:56,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182129144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:38:56,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:38:56,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:38:56,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18945760] [2022-07-13 14:38:56,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:38:56,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:38:56,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:38:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:38:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:38:56,627 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:38:57,328 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2022-07-13 14:38:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:38:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-13 14:38:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:38:57,330 INFO L225 Difference]: With dead ends: 118 [2022-07-13 14:38:57,330 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 14:38:57,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:38:57,330 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 14:38:57,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 708 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 26 Unchecked, 0.7s Time] [2022-07-13 14:38:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 14:38:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2022-07-13 14:38:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 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-13 14:38:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2022-07-13 14:38:57,342 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 28 [2022-07-13 14:38:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:38:57,342 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2022-07-13 14:38:57,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:38:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2022-07-13 14:38:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 14:38:57,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:38:57,344 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, 1] [2022-07-13 14:38:57,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 14:38:57,556 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-13 14:38:57,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:38:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:38:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash -511928521, now seen corresponding path program 1 times [2022-07-13 14:38:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:38:57,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331641148] [2022-07-13 14:38:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:38:57,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:38:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:38:57,559 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-13 14:38:57,560 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-13 14:38:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:38:57,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:38:57,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:39:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:39:01,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:39:01,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:39:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331641148] [2022-07-13 14:39:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331641148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:39:01,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:39:01,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:39:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593751786] [2022-07-13 14:39:01,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:39:01,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:39:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:39:01,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:39:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:39:01,267 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:39:04,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:39:04,944 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-07-13 14:39:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:39:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-13 14:39:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:39:04,956 INFO L225 Difference]: With dead ends: 119 [2022-07-13 14:39:04,956 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 14:39:04,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:39:04,957 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 14:39:04,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 711 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 30 Unchecked, 3.7s Time] [2022-07-13 14:39:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 14:39:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-07-13 14:39:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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-13 14:39:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-07-13 14:39:04,961 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-07-13 14:39:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:39:04,961 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-07-13 14:39:04,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:39:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-07-13 14:39:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:39:04,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:39:04,963 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, 1, 1] [2022-07-13 14:39:05,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-13 14:39:05,163 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-13 14:39:05,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:39:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:39:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -42468524, now seen corresponding path program 1 times [2022-07-13 14:39:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:39:05,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990880899] [2022-07-13 14:39:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:39:05,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:39:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:39:05,166 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-13 14:39:05,177 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-13 14:39:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:39:05,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 14:39:05,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:39:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:39:12,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:39:12,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:39:12,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990880899] [2022-07-13 14:39:12,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990880899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:39:12,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:39:12,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:39:12,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182989633] [2022-07-13 14:39:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:39:12,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:39:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:39:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:39:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:39:12,267 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:39:14,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:21,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:23,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:25,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:34,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:35,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:39,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:41,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:45,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:47,113 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-13 14:39:50,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:53,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:39:55,917 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-13 14:39:58,798 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-13 14:39:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:39:59,376 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2022-07-13 14:39:59,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:39:59,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2022-07-13 14:39:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:39:59,379 INFO L225 Difference]: With dead ends: 109 [2022-07-13 14:39:59,379 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 14:39:59,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:39:59,379 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 97 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.8s IncrementalHoareTripleChecker+Time [2022-07-13 14:39:59,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 294 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 43.8s Time] [2022-07-13 14:39:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 14:39:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2022-07-13 14:39:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 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-13 14:39:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-07-13 14:39:59,384 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 29 [2022-07-13 14:39:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:39:59,384 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-07-13 14:39:59,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:39:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-07-13 14:39:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:39:59,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:39:59,384 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, 1, 1] [2022-07-13 14:39:59,401 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-13 14:39:59,599 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-13 14:39:59,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:39:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:39:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1779988844, now seen corresponding path program 1 times [2022-07-13 14:39:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:39:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688160386] [2022-07-13 14:39:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:39:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:39:59,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:39:59,602 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-13 14:39:59,603 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-13 14:39:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:39:59,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:39:59,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:03,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:03,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688160386] [2022-07-13 14:40:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688160386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:03,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:03,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:40:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100606558] [2022-07-13 14:40:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:03,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:40:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:03,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:40:03,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:40:03,125 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:03,130 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2022-07-13 14:40:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:40:03,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2022-07-13 14:40:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:03,130 INFO L225 Difference]: With dead ends: 161 [2022-07-13 14:40:03,130 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 14:40:03,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:40:03,131 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:03,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 585 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-13 14:40:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 14:40:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-07-13 14:40:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 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-13 14:40:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2022-07-13 14:40:03,135 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2022-07-13 14:40:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2022-07-13 14:40:03,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2022-07-13 14:40:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:40:03,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:03,136 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, 1, 1] [2022-07-13 14:40:03,154 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-13 14:40:03,353 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-13 14:40:03,353 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2018423094, now seen corresponding path program 1 times [2022-07-13 14:40:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:03,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725112118] [2022-07-13 14:40:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:03,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:03,355 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-13 14:40:03,356 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-13 14:40:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:03,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:40:03,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:09,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:09,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:09,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725112118] [2022-07-13 14:40:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725112118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:09,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:09,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:40:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115992577] [2022-07-13 14:40:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:09,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:40:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:40:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:40:09,176 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:09,586 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-07-13 14:40:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:40:09,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-07-13 14:40:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:09,588 INFO L225 Difference]: With dead ends: 107 [2022-07-13 14:40:09,589 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 14:40:09,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:40:09,590 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:09,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 42 Unchecked, 0.4s Time] [2022-07-13 14:40:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 14:40:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-13 14:40:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 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-13 14:40:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2022-07-13 14:40:09,605 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 29 [2022-07-13 14:40:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:09,605 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2022-07-13 14:40:09,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2022-07-13 14:40:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:40:09,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:09,609 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, 1, 1] [2022-07-13 14:40:09,624 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-13 14:40:09,822 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-13 14:40:09,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1308443982, now seen corresponding path program 1 times [2022-07-13 14:40:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:09,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840234445] [2022-07-13 14:40:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:09,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:09,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:09,825 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-13 14:40:09,827 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-13 14:40:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:10,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:40:10,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:15,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:15,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840234445] [2022-07-13 14:40:15,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840234445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:15,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:40:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120088170] [2022-07-13 14:40:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:40:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:40:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:40:15,879 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:18,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:40:20,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:40:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:20,749 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2022-07-13 14:40:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:40:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-07-13 14:40:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:20,766 INFO L225 Difference]: With dead ends: 108 [2022-07-13 14:40:20,766 INFO L226 Difference]: Without dead ends: 104 [2022-07-13 14:40:20,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:40:20,767 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:20,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 4.9s Time] [2022-07-13 14:40:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-13 14:40:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-13 14:40:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 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-13 14:40:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-07-13 14:40:20,778 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 29 [2022-07-13 14:40:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:20,778 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-07-13 14:40:20,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-07-13 14:40:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 14:40:20,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:20,779 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, 1, 1, 1] [2022-07-13 14:40:20,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-13 14:40:20,987 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-13 14:40:20,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:20,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1854170638, now seen corresponding path program 1 times [2022-07-13 14:40:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560484907] [2022-07-13 14:40:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:20,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:20,990 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:40:20,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 14:40:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:21,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 14:40:21,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:22,913 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-13 14:40:24,155 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 16 treesize of output 8 [2022-07-13 14:40:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:36,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:36,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:36,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560484907] [2022-07-13 14:40:36,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560484907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:36,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:36,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:40:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813969259] [2022-07-13 14:40:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:36,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 14:40:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 14:40:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-13 14:40:36,034 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:36,074 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-07-13 14:40:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:40:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2022-07-13 14:40:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:36,078 INFO L225 Difference]: With dead ends: 109 [2022-07-13 14:40:36,078 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 14:40:36,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-13 14:40:36,078 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:36,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 932 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2022-07-13 14:40:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 14:40:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-13 14:40:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 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-13 14:40:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2022-07-13 14:40:36,082 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 30 [2022-07-13 14:40:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:36,082 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2022-07-13 14:40:36,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2022-07-13 14:40:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 14:40:36,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:36,085 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, 1, 1, 1] [2022-07-13 14:40:36,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 14:40:36,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:40:36,287 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1905565682, now seen corresponding path program 1 times [2022-07-13 14:40:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:36,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143589484] [2022-07-13 14:40:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:36,290 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:40:36,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 14:40:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:36,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 14:40:36,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:51,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:51,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:51,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143589484] [2022-07-13 14:40:51,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143589484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:51,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:51,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 14:40:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925122206] [2022-07-13 14:40:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:51,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 14:40:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:51,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 14:40:51,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=56, Unknown=1, NotChecked=0, Total=72 [2022-07-13 14:40:51,634 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:54,139 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2022-07-13 14:40:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:40:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-07-13 14:40:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:54,140 INFO L225 Difference]: With dead ends: 167 [2022-07-13 14:40:54,140 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 14:40:54,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2022-07-13 14:40:54,142 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 7 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:54,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 929 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-13 14:40:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 14:40:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-07-13 14:40:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 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-13 14:40:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2022-07-13 14:40:54,154 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 30 [2022-07-13 14:40:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:54,155 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2022-07-13 14:40:54,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:40:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-07-13 14:40:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 14:40:54,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:54,156 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:40:54,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 14:40:54,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:40:54,359 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1918665192, now seen corresponding path program 1 times [2022-07-13 14:40:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:54,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002210845] [2022-07-13 14:40:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:54,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:40:54,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 14:40:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:54,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:40:54,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:40:57,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:40:57,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:40:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002210845] [2022-07-13 14:40:57,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002210845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:40:57,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:40:57,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:40:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257474210] [2022-07-13 14:40:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:40:57,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:40:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:40:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:40:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:40:57,274 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 14:40:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:40:57,277 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2022-07-13 14:40:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:40:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2022-07-13 14:40:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:40:57,278 INFO L225 Difference]: With dead ends: 139 [2022-07-13 14:40:57,278 INFO L226 Difference]: Without dead ends: 101 [2022-07-13 14:40:57,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:40:57,279 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:40:57,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-13 14:40:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-13 14:40:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-13 14:40:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 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-13 14:40:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2022-07-13 14:40:57,295 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 35 [2022-07-13 14:40:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:40:57,295 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2022-07-13 14:40:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 14:40:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-07-13 14:40:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 14:40:57,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:40:57,296 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:40:57,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 14:40:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:40:57,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:40:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:40:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 469180040, now seen corresponding path program 1 times [2022-07-13 14:40:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:40:57,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537343571] [2022-07-13 14:40:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:40:57,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:40:57,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:40:57,522 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:40:57,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 14:40:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:40:57,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 14:40:57,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:40:59,352 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-13 14:41:00,752 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 16 treesize of output 8 [2022-07-13 14:41:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:41:07,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:41:07,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:41:07,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537343571] [2022-07-13 14:41:07,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537343571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:41:07,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:41:07,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:41:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236748799] [2022-07-13 14:41:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:41:07,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 14:41:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:41:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 14:41:07,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:41:07,585 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:41:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:41:07,589 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-07-13 14:41:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:41:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 34 [2022-07-13 14:41:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:41:07,590 INFO L225 Difference]: With dead ends: 158 [2022-07-13 14:41:07,590 INFO L226 Difference]: Without dead ends: 84 [2022-07-13 14:41:07,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:41:07,591 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:41:07,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 632 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-07-13 14:41:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-13 14:41:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-13 14:41:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 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-13 14:41:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2022-07-13 14:41:07,596 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 34 [2022-07-13 14:41:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:41:07,596 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2022-07-13 14:41:07,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:41:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-07-13 14:41:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 14:41:07,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:41:07,597 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:41:07,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-13 14:41:07,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:41:07,835 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:41:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:41:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1116359772, now seen corresponding path program 1 times [2022-07-13 14:41:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:41:07,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383963443] [2022-07-13 14:41:07,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:41:07,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:41:07,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:41:07,853 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:41:07,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 14:41:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:41:08,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 14:41:08,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:41:14,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-13 14:41:14,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:41:14,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:41:14,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383963443] [2022-07-13 14:41:14,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383963443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:41:14,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:41:14,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:41:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696096125] [2022-07-13 14:41:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:41:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:41:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:41:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:41:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:41:14,118 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:41:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:41:14,120 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-07-13 14:41:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:41:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 35 [2022-07-13 14:41:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:41:14,121 INFO L225 Difference]: With dead ends: 84 [2022-07-13 14:41:14,121 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:41:14,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:41:14,121 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:41:14,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-13 14:41:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:41:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:41:14,122 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-13 14:41:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:41:14,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-07-13 14:41:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:41:14,122 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:41:14,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:41:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:41:14,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:41:14,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:41:14,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-13 14:41:14,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:41:14,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:41:20,266 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-13 14:41:20,266 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-13 14:41:20,266 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-13 14:41:20,266 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-13 14:41:20,266 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-13 14:41:20,267 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L895 garLoopResultBuilder]: At program point L268(lines 261 269) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_double_#res#1| (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 289) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-13 14:41:20,268 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-13 14:41:20,269 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_34| (_ BitVec 64))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|))) (not (= (bvlshr (bvadd (_ bv2148532224 32) (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) (_ bv2147483647 32))) (_ bv31 32)) (_ bv0 32))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse2 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7|))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv0 32)))) (and (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand .cse0 (_ bv2147483647 32))) (= |ULTIMATE.start___ieee754_atan2_~lx~0#1| .cse1) (= .cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_35|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))))) (exists ((|v_skolemized_q#valueAsBitvector_124| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33|) (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_124|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_124|) .cse3) (= |ULTIMATE.start___ieee754_atan2_~hx~1#1| .cse3)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L895 garLoopResultBuilder]: At program point L258(lines 247 259) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L902 garLoopResultBuilder]: At program point L292(lines 271 293) the Hoare annotation is: true [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:41:20,269 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-13 14:41:20,269 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) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L263-1(lines 263 267) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L895 garLoopResultBuilder]: At program point L263-2(lines 263 267) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= |ULTIMATE.start_isfinite_double_~x#1| |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L263-3(lines 263 267) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 287) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 290) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L281-4(lines 281 290) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-13 14:41:20,270 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)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= |ULTIMATE.start___ieee754_atan2_~y#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|))) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-13 14:41:20,270 INFO L899 garLoopResultBuilder]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2022-07-13 14:41:20,271 INFO L895 garLoopResultBuilder]: At program point L249-2(lines 249 254) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-13 14:41:20,271 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-13 14:41:20,271 INFO L899 garLoopResultBuilder]: For program point L249-3(lines 249 254) no Hoare annotation was computed. [2022-07-13 14:41:20,271 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-13 14:41:20,271 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-13 14:41:20,271 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-13 14:41:20,273 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:41:20,274 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:41:20,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,306 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,307 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,313 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,313 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:41:20 BoogieIcfgContainer [2022-07-13 14:41:20,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:41:20,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:41:20,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:41:20,314 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:41:20,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:38:04" (3/4) ... [2022-07-13 14:41:20,317 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:41:20,320 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-13 14:41:20,320 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-13 14:41:20,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-07-13 14:41:20,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-13 14:41:20,327 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 14:41:20,327 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:41:20,343 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-13 14:41:20,343 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-13 14:41:20,343 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-13 14:41:20,344 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-13 14:41:20,344 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 currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:41:20,344 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_34 : bv64 :: y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(v_skolemized_q#valueAsBitvector_34[63:32], 2147483647bv32)), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_124 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33 : bv32, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_124[63:63], v_skolemized_q#valueAsBitvector_124[62:52], v_skolemized_q#valueAsBitvector_124[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_124[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32]) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:41:20,344 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:41:20,385 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:41:20,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:41:20,386 INFO L158 Benchmark]: Toolchain (without parser) took 220193.49ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.3MB in the beginning and 38.9MB in the end (delta: -1.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,386 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:41:20,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.52ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 616.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.49ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 33.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,387 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 30.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,387 INFO L158 Benchmark]: RCFGBuilder took 24167.98ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.7MB in the beginning and 44.4MB in the end (delta: -13.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,387 INFO L158 Benchmark]: TraceAbstraction took 195440.79ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 45.9MB in the end (delta: -2.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,387 INFO L158 Benchmark]: Witness Printer took 71.23ms. Allocated memory is still 71.3MB. Free memory was 45.9MB in the beginning and 38.9MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:41:20,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.0MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.52ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 36.5MB in the end (delta: 616.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.49ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 33.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 30.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 24167.98ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.7MB in the beginning and 44.4MB in the end (delta: -13.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 195440.79ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 45.9MB in the end (delta: -2.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Witness Printer took 71.23ms. Allocated memory is still 71.3MB. Free memory was 45.9MB in the beginning and 38.9MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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: 287]: 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, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 195.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 55.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 11598 SdHoareTripleChecker+Invalid, 52.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 609 IncrementalHoareTripleChecker+Unchecked, 9512 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2086 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 383 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 63.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=14, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 77 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 82 PreInvPairs, 90 NumberOfFragments, 386 HoareAnnotationTreeSize, 82 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 343 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 117.4s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 482 ConstructedInterpolants, 316 QuantifiedInterpolants, 7386 SizeOfPredicates, 156 NumberOfNonLiveVariables, 3307 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-13 14:41:20,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,414 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())) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 263]: Loop Invariant [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 156]: Loop Invariant [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-13 14:41:20,424 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())) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64 :: y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(v_skolemized_q#valueAsBitvector_34[63:32], 2147483647bv32)), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_124 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33 : bv32, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_124[63:63], v_skolemized_q#valueAsBitvector_124[62:52], v_skolemized_q#valueAsBitvector_124[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_124[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32]) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 261]: Loop Invariant [2022-07-13 14:41:20,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,426 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,427 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 247]: Loop Invariant [2022-07-13 14:41:20,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-13 14:41:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-13 14:41:20,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant [2022-07-13 14:41:20,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,437 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 && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant [2022-07-13 14:41:20,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,440 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:41:20,445 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:41:20,445 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) RESULT: Ultimate proved your program to be correct! [2022-07-13 14:41:20,662 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-13 14:41:20,741 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